Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.1
1.8
Journals
Algorithms
Special Issues
Scheduling, Sequencing and Assignment Problems with Applications in Logistics
share announcement

Scheduling, Sequencing and Assignment Problems with Applications in Logistics

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".

Deadline for manuscript submissions: closed (15 August 2022) | Viewed by 16981

Special Issue Editor

Dr. Pieter Smet

E-Mail Website
Guest Editor
Department of Computer Science, CODeS research group, KU Leuven, 9000 Gent, Belgium
Interests: combinatorial optimization; algorithms for scheduling; algorithms for sequencing; assignment problems

Special Issue Information

Dear Colleagues,

Optimization problems are ubiquitous in logistics, where the scheduling, sequencing and assignment of activities and resources have a significant impact on operational efficiency. These optimization problems are encountered across the entirety of the modern supply chain: sequencing orders on production lines, scheduling cranes in container warehouses or assigning customers to delivery truck routes. Similar logistics problems also frequently feature in other applications, such as airline crew scheduling, home care scheduling and the optimization of hospital logistics. A range of solution methodologies can be applied to obtain optimal or approximate solutions for these diverse problems. Some examples include metaheuristics, integer programming or simulation-based methods. Moreover, the specific applications that are addressed by researchers often give rise to new classes of combinatorial optimization problems which can also be studied from a theoretical perspective.

We invite you to submit your latest research in the area of Operations Research and Combinatorial Optimization to this Special Issue on “Scheduling, Sequencing and Assignment problems with Applications in Logistics”. We welcome contributions presenting practical applications as well as theoretical results on new and traditional scheduling, sequencing and assignment problems. Researchers from both academia and industry are invited to contribute their latest research.

Keywords

  • Machine Scheduling
  • Multi-dimensional Assignment Problems
  • Sequencing Problems
  • Complex Scheduling Problems
  • Staff Scheduling
  • Vehicle Routing
  • Warehouse Optimization
  • Home Care Scheduling
  • Berth Allocation
  • Crane Scheduling
  • Metaheuristics
  • Integer Programming
  • Constraint Programming
  • Simulation
  • Stochastic Programming

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue polices can be found here.

Published Papers (6 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

Jump to: Review

23 pages, 3198 KiB  
Article
Blocking Cyclic Job-Shop Scheduling Problems
by Atabak Elmi, Dhananjay R. Thiruvady and Andreas T. Ernst
Algorithms 2022, 15(10), 375; https://doi.org/10.3390/a15100375 - 14 Oct 2022
Viewed by 2044
Abstract
Cyclic scheduling is of vital importance in a repetitive discrete manufacturing environment. We investigate scheduling in the context of general cyclic job shops with blocking where there are no intermediate buffers between the machines. We also consider sequence-dependent setups (anticipatory and nonanticipatory), which [...] Read more.
Cyclic scheduling is of vital importance in a repetitive discrete manufacturing environment. We investigate scheduling in the context of general cyclic job shops with blocking where there are no intermediate buffers between the machines. We also consider sequence-dependent setups (anticipatory and nonanticipatory), which commonly appear in different manufacturing environments. The choice of blocking condition, that is whether the sequence-dependent setups are anticipatory or not, significantly impacts the optimal schedules. We provide a novel mixed-integer programming (MIP) model for the above problem, namely blocking cyclic job-shop scheduling. Furthermore, we study the impact of sequence-dependent setups in this research. The problem is analysed in detail with respect to anticipatory and nonanticipatory setups and the efficiency of the proposed model is investigated via a computational study that is conducted on a set of randomly generated problem instances. The proposed MIP models are capable of solving small-to-medium-sized problems. Moreover, the analysis presented demonstrates that anticipatory setups directly affect blocking conditions, since intermediate buffers between the machines are not present. Hence, in systems with anticipatory setups, cycle times increase to a greater extent compared to systems with nonanticipatory setups. Full article
(This article belongs to the Special Issue Scheduling, Sequencing and Assignment Problems with Applications in Logistics)
►▼ Show Figures

Figure 1

19 pages, 2856 KiB  
Article
Flexible Job Shop Scheduling Problem with Fuzzy Times and Due-Windows: Minimizing Weighted Tardiness and Earliness Using Genetic Algorithms
by Emiro Antonio Campo, Jose Alejandro Cano, Rodrigo Gómez-Montoya, Elkin Rodríguez-Velásquez and Pablo Cortés
Algorithms 2022, 15(10), 334; https://doi.org/10.3390/a15100334 - 20 Sep 2022
Cited by 7 | Viewed by 2429
Abstract
The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which prevents obtaining deterministic setup and processing times. Likewise, several industries present [...] Read more.
The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve the production of multiple products with different processing routes and products with short life cycles, which prevents obtaining deterministic setup and processing times. Likewise, several industries present restrictions when changing from one reference to another in the production system, incurring variable and sequence-dependent setup times. Therefore, this article aims to solve the flexible job shop scheduling problem (FJSSP) considering due windows, sequence-dependent setup times, and uncertainty in processing and setup times. A genetic algorithm is proposed to solve the FJSSP by integrating fuzzy logic to minimize the weighted penalties for tardiness/earliness. The proposed algorithm is implemented in a real-world case study of a fabric finishing production system, and it is compared with four heuristics adapted to the FJSSP such as earliest due date, critical reason, shortest processing time, and Monte Carlo simulation. Results show that the performance of the proposed algorithm provides efficient and satisfactory solutions concerning the objective function and computing time since it overperforms (more than 30%) the heuristics used as benchmarks. Full article
(This article belongs to the Special Issue Scheduling, Sequencing and Assignment Problems with Applications in Logistics)
►▼ Show Figures

Figure 1

28 pages, 582 KiB  
Article
Allocating Small Transporters to Large Jobs
by Neil Jami, Neele Leithäuser and Christian Weiß
Algorithms 2022, 15(2), 60; https://doi.org/10.3390/a15020060 - 12 Feb 2022
Cited by 1 | Viewed by 1978
Abstract
We optimize the assignment of transporters to several jobs. Each job consists of processing a large, decomposable volume. A fleet of transporters is given, each of which can only process a limited volume at a time. After processing its share, a transporter must [...] Read more.
We optimize the assignment of transporters to several jobs. Each job consists of processing a large, decomposable volume. A fleet of transporters is given, each of which can only process a limited volume at a time. After processing its share, a transporter must rest for a short time before being able to process another part. This time is only dependent on the assigned job, not on the transporter. Other transporters can take over the processing while a transporter rests. Transporters assigned to the same job wait for their turn in a queue. A transporter can only be assigned to one job. Our goal is to simultaneously minimize the maximum job completion time and the number of assigned transporters by computing the frontier of Pareto optimal solutions. In general, we show that it is NP-hard in the strong sense to compute even a single point on the Pareto frontier. We provide exact methods and heuristics to compute the Pareto frontier for the general problem and compare them computationally. Full article
(This article belongs to the Special Issue Scheduling, Sequencing and Assignment Problems with Applications in Logistics)
►▼ Show Figures

Figure 1

23 pages, 1198 KiB  
Article
Hybrid Multiagent Collaboration for Time-Critical Tasks: A Mathematical Model and Heuristic Approach
by Yifeng Zhou, Kai Di and Haokun Xing
Algorithms 2021, 14(11), 327; https://doi.org/10.3390/a14110327 - 5 Nov 2021
Cited by 1 | Viewed by 1844
Abstract
Principal–assistant agent teams are often employed to solve tasks in multiagent collaboration systems. Assistant agents attached to the principal agents are more flexible for task execution and can assist them to complete tasks with complex constraints. However, how to employ principal–assistant agent teams [...] Read more.
Principal–assistant agent teams are often employed to solve tasks in multiagent collaboration systems. Assistant agents attached to the principal agents are more flexible for task execution and can assist them to complete tasks with complex constraints. However, how to employ principal–assistant agent teams to execute time-critical tasks considering the dependency between agents and the constraints among tasks is still a challenge so far. In this paper, we investigate the principal–assistant collaboration problem with deadlines, which is to allocate tasks to suitable principal–assistant teams and construct routes satisfying the temporal constraints. Two cases are considered in this paper, including single principal–assistant teams and multiple principal–assistant teams. The former is formally formulated in an arc-based integer linear programming model. We develop a hybrid combination algorithm for adapting larger scales, the idea of which is to find an optimal combination of partial routes generated by heuristic methods. The latter is defined in a path-based integer linear programming model, and a branch-and-price-based (BP-based) algorithm is proposed that introduces the number of assistant-accessible tasks surrounding a task to guide the route construction. Experimental results validate that the hybrid combination algorithm and the BP-based algorithm are superior to the benchmarks in terms of the number of served tasks and the running time. Full article
(This article belongs to the Special Issue Scheduling, Sequencing and Assignment Problems with Applications in Logistics)
►▼ Show Figures

Figure 1

30 pages, 9090 KiB  
Article
Non-Traditional Layout Design for Robotic Mobile Fulfillment System with Multiple Workstations
by Xiuqing Yang, Xinglu Liu, Lijuan Feng, Jianquan Zhang and Mingyao Qi
Algorithms 2021, 14(7), 203; https://doi.org/10.3390/a14070203 - 30 Jun 2021
Cited by 6 | Viewed by 3555
Abstract
This paper studies the layout design of a robotic mobile fulfillment system with multiple workstations. This is a parts-to-picker storage system where robots hoist pods and bring them directly to the workstations for stationary pickers to retrieve required items. As few research efforts [...] Read more.
This paper studies the layout design of a robotic mobile fulfillment system with multiple workstations. This is a parts-to-picker storage system where robots hoist pods and bring them directly to the workstations for stationary pickers to retrieve required items. As few research efforts have focused on determining the optimal locations of workstations in such systems, we develop an integer programming model to determine the location of workstations to minimize the total traveling distance of robots. In addition, we investigate the near-optimal workstation location patterns (i.e., some general workstation configuration rules) in the context of both traditional and flying-V layouts. A series of experiments led to the following findings: (1) the flying-V layout can save 8∼26% of travel distance compared with the traditional layout, and the sacrifice of space use is only 2∼3% for medium or large warehouses; (2) instead of solving the optimization model, the proposed 2n rule and n+1 rule are simple and easily implemented ways to locate workstations, with travel distance gaps of less than 1.5% and 5% for traditional and flying-V layouts, respectively; and (3) the “optimal” cross-aisle angle (i.e., θ) in flying-V layout can be set as large as possible as long as the cross-aisle intersects the left or right edge of the warehouse. Full article
(This article belongs to the Special Issue Scheduling, Sequencing and Assignment Problems with Applications in Logistics)
►▼ Show Figures

Figure 1

Review

Jump to: Research

20 pages, 2686 KiB  
Review
Modelling Cross-Docking in a Three-Level Supply Chain with Stochastic Service and Queuing System: MOWFA Algorithm
by Parinaz Rostami, Soroush Avakh Darestani and Mitra Movassaghi
Algorithms 2022, 15(8), 265; https://doi.org/10.3390/a15080265 - 28 Jul 2022
Cited by 8 | Viewed by 2807
Abstract
In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an [...] Read more.
In today’s competitive world, it is essential to provide a new method through which maximum efficiency can be created in the production and supply cycle. In many production environments, sending goods directly from the producer to the consumer brings many problems. Therefore, an efficient transport system should be established between producers and consumers. Such a system is designed in the field of supply chain management knowledge. Supply chain management is the evolutionary result of warehousing management and is one of the important infrastructural foundations of business implementation, in many of which the main effort is to shorten the time between the customer’s order and the actual delivery of the goods. In this research, the supply chain consists of three levels. Suppliers are placed on the first level, cross-docks on the second level, and factories on the third level. In this system, a number of suppliers send different raw materials to several different cross-docks. Each channel is assigned to a cross-dock for a specific product. The main goal of this article is to focus on optimizing the planning of incoming and outgoing trucks with the aim of minimizing the total operation time within the supply chain. The arrival rate of goods from suppliers to the cross-dock is stochastic with a general probability distribution. On the other hand, the time required to prepare and send the goods is random with a general probability distribution. The service time in each cross-dock depends on the number of its doors. Therefore, each cross-dock can be modeled as a G/G/m queueing system where m represents the number of doors. The mathematical model of the research has been developed based on these assumptions. Since the problem is NP-hard, the time to solve it increases drastically with the increase in the dimensions of the problem. Therefore, three metaheuristics, including multi-objective water flow, non-dominated sorting genetic, and a multi-objective simulated annealing algorithm have been used to find near-optimal solutions to the problem. After adjusting the parameters of the algorithms using the Taguchi method, the results obtained from the algorithms were analyzed with a statistical test and the performance of the algorithms was evaluated. The results vividly demonstrate that non-dominated sorting genetics is the best of all. Full article
(This article belongs to the Special Issue Scheduling, Sequencing and Assignment Problems with Applications in Logistics)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-6
Back to TopTop