1,368 results
Search Results
2. Analytics and machine learning in scheduling and routing research.
- Author
-
Bai, Ruibin, Chen, Zhi-Long, and Kendall, Graham
- Subjects
ARTIFICIAL neural networks ,PRODUCTION scheduling ,OPERATIONS research ,MACHINE learning ,FLOW shop scheduling ,SCHEDULING ,CONTAINER terminals ,STOCHASTIC programming - Abstract
In total, more than 200 papers were reviewed and classified into 4 categories which are: machine learning assisted VRP modelling, machine learning guided VRP decomposition strategies, machine learning guided perturbative VRP algorithms, and finally learning to construct VRP solutions. It provides an extensive review of vehicle routing (VRP) researches that use both analytical optimisation approaches and machine learning (ML) modules and mechanisms. This special issue largely originated from various discussions during several cross-domain, multi-disciplinary conferences and workshops, especially the 9th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA2019), which attracted scientists, researchers and practitioners from Computer Science, Operations Research as well as Business and Management. " A Two-Stage Stochastic Programming Model for Collaborative Asset Protection Routing Problem Enhanced with Machine Learning; A Learning Based Matheuristic Algorithm.". [Extracted from the article]
- Published
- 2023
- Full Text
- View/download PDF
3. The economic lot scheduling problem: a content analysis.
- Author
-
Beck, Fabian G. and Glock, Christoph H.
- Subjects
CONTENT analysis ,PRODUCTION scheduling ,IRRIGATION scheduling ,PERIODICAL articles ,PROBLEM solving - Abstract
The paper at hand addresses the Economic Lot Scheduling Problem (ELSP), which is concerned with finding a feasible and cost-minimal production schedule for multiple items produced in lots on a single machine. The ELSP started to attract the attention of researchers in the 1950s, where the focus was primarily on the development of simple heuristics for solving the problem. Over the subsequent decades, this topic has frequently been addressed in the literature, with the subject of research being the development of new scheduling policies or solution procedures or extensions of the scope of the original model. To date, a large number of journal articles has been published on the ELSP and its model variants. To identify key research themes, publication patterns and opportunities for future research, the paper at hand applies a content analysis to a sample of 242 papers published on the Economic Lot Scheduling Problem. The results of the content analysis indicate that prior research on this topic had a strong focus on the development of solution methodologies, and that several aspects that are directly connected to lot sizing and scheduling have not attracted much attention in research on the ELSP yet, such as, for example, energy cost and sustainability. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
4. Genetic algorithms for planning and scheduling engineer-to-order production: a systematic review.
- Author
-
Neumann, Anas, Hajji, Adnene, Rekik, Monia, and Pellerin, Robert
- Subjects
GENETIC algorithms ,MACHINE learning ,PRODUCTION scheduling ,ENGINEERING design ,EVOLUTIONARY algorithms - Abstract
This paper provides a systematic review of the Genetic Algorithm (GA)s proposed to solve planning and scheduling problems in Engineer-To-Order (ETO) contexts. Our review focuses on how the key characteristics of ETO projects affect both the problem studied and the GA algorithmic features. Typical ETO projects consist of one-of-a-kind products with complex structures and uncertain designs. A deep analysis of the papers published between 2000 and 2022 enables identifying 10 main characteristics of ETO projects, six activity types, 10 decision types, eight groups of constraints, and 10 optimisation objectives. Our study shows that none of the reported papers integrates all 10 ETO characteristics. The less studied ETO characteristics are incorporating design and engineering information in the problem definition and the design uncertainty. Our review also identifies 10 recurrent encoding formats and emphasises the most frequently used genetic operators. We observed that most planning and scheduling problems consider objectives and decisions related to product customisation or supply chain configuration yielding multi-objective problems. Most multi-objective GAs use a weighted sum or are based on NSGAII. Diversity maintenance methods, adaptive and parameter tunning mechanisms, or hybridisation with machine learning models are still not used in this context. A systematic review of genetic algorithms dedicated to industrial planning and scheduling Analysis on how the characteristics of ETO projects impact the design of genetic representation and operators Recommendation on approaches employed to reach high-quality solutions [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’.
- Author
-
Companys, Ramon and Ribas, Imma
- Subjects
FLOW shop scheduling ,PRODUCTION scheduling ,FLOW shops ,MATHEMATICAL models ,PRODUCTION control ,ALGORITHMS ,MANUFACTURING processes - Abstract
In this paper, we demonstrate that the relation between two jobs defined by min{a
i , bj } ≤ min{bi , aj }, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct. [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
6. A new approach for production project scheduling with time-cost-quality trade-off considering multi-mode resource-constraints under interval uncertainty.
- Author
-
Ghasemi, M., Mousavi, S. M., Aramesh, S., Shahabi-Shahmiri, R., Zavadskas, E. K., and Antucheviciene, J.
- Subjects
PRODUCTION scheduling ,GROUP decision making ,PRODUCTION planning ,MIXED integer linear programming ,SENSITIVITY analysis ,MATHEMATICAL models ,HAMMING distance - Abstract
Due to today's competitive environment and information boom, companies are concerned about production planning in uncertain conditions. This paper integrates decision-making method with production scheduling model by considering limited resources. In this paper, a new mathematical model is extended for production project scheduling with multiple execution modes. The main aim of the formulation is to plan and schedule real production projects in uncertain environments. A new mixed-integer linear formulation is presented by considering trade-off of cost, time, as well as quality. Cost–time-quality trade-off is extended with the interval information. In the presented model, activity quality could be enhanced by reworking. The interval forms of some parameters, including duration, quality of activities, cost, and total available resources, are obtained by determining weights of experts and aggregating them. The presented group decision-making method is based on a bi-directional projection measure to deal with interval information. Since the mathematical model is multi-objective and some data are interval, a new modified solution method is developed for solving the model. The presented method for both decision-making and mathematical models is investigated by a real-world production project and two datasets to ascertain the accuracy of the model. Finally, an appropriate sensitivity analysis is proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. A stochastic optimisation approach to maintain supply chain viability under the ripple effect.
- Author
-
Sawik, Tadeusz
- Subjects
SUPPLY chains ,EXTREME value theory ,PRODUCTION scheduling ,SUPPLY chain management - Abstract
This paper presents a novel quantitative approach and stochastic quadratic optimisation model to maintain supply chain viability under the ripple effect. Instead of viability kernel commonly used in the viability theory, this paper establishes the boundaries on acceptable production states for which the production can be continued under the ripple effect, with no severe losses. For a given implementable portfolio of controls, the boundaries on acceptable production trajectories associated with the two conflicting objectives, cost and customer service level are determined. The decision maker selects a viable production trajectory in-between the two boundary trajectories: the cost-optimal and the service-optimal. The selection depends on the decision maker preference, represented by a chosen weight factor in the optimised quadratic objective function that minimises weighted deviations from the cost-optimal and from the service-optimal production schedules under the ripple effect. The findings indicate that for the extreme values of the weight factor, the viable production trajectory is inclined toward the corresponding boundary trajectory and remains in-between the two boundaries, when both objectives are equally important. Keeping production trajectory in-between the two boundaries makes the supply chain more resilient to disruption risks, while the supply chain resilience diminishes as the production trajectory approaches a boundary trajectory. Then a more severe disruption may push the production outside the viability region and cause greater losses. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
8. A new neighbourhood structure for job shop scheduling problems.
- Author
-
Xie, Jin, Li, Xinyu, Gao, Liang, and Gui, Lin
- Subjects
PRODUCTION scheduling ,NEIGHBORHOODS ,FLOW shops ,COMBINATORIAL optimization - Abstract
Job shop scheduling problem (JSP) is a widely studied NP-complete combinatorial optimisation problem. Neighbourhood structures play a critical role in solving JSP. At present, there are three state-of-the-art neighbourhood structures, i.e. N5, N6, and N7. Improving the upper bounds of some famous benchmarks is inseparable from the role of these neighbourhood structures. However, these existing neighbourhood structures only consider the movement of critical operations within a critical block. According to our experiments, it is also possible to improve the makespan of a scheduling scheme by moving a critical operation outside its critical block. According to the above finding, this paper proposes a new N8 neighbourhood structure considering the movement of critical operations within a critical block and the movement of critical operations outside the critical block. Besides, a neighbourhood clipping method is designed to avoid invalid movement, discarding non-improving moves. Tabu search (TS) is a commonly used algorithm framework combined with neighbourhood structures. This paper uses this framework to compare the N8 neighbourhood structure with N5, N6, and N7 neighbourhood structures on four famous benchmarks. The experimental results verify that the N8 neighbourhood structure is more effective and efficient in solving JSP than the other state-of-the-art neighbourhood structures. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Real-time scheduling simulation optimisation of job shop in a production-logistics collaborative environment.
- Author
-
Cai, Lei, Li, Wenfeng, Luo, Yun, and He, Lijun
- Subjects
JOB shops ,PRODUCTION scheduling ,ENERGY consumption ,FLOW shops ,SCHEDULING ,CUSTOMER satisfaction - Abstract
In a complex and dynamic job shop containing logistics factor, schedule needs to be generated rapidly, so the real-time scheduling method is more suitable for such scenario. Such method takes advantage of local information within a short time due to the rapid changes of information under uncertain environment. Therefore, how to make use of the future information by prediction while ensuring the robustness of schedule is a valuable problem. To solve it, firstly, a new real-time scheduling model and algorithm is proposed. There is a new kind of release moment of task information which can give AGVs the longest time to prepare for the task than existing research. Secondly, a real-time information update mechanism is designed to increase schedule's robustness. Finally, a large-scale and dynamic job shop simulation experimental platform is developed. Dynamic factors include the random insertion of orders and failures of equipment. Results show that the method proposed outperforms existing research in terms of customer satisfaction, equipment utilisation and energy consumption. The robustness of schedule can also be acceptable. This paper also finds a rule that in job shop with the large proportion of logistics transportation time, the above method can achieve more competitive results. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
10. Modelling and solving algorithm for two-stage scheduling of construction component manufacturing with machining and welding process.
- Author
-
Meng, Ronghua, Rao, Yunqing, Zheng, Yun, and Qi, Dezhong
- Subjects
CONSTRUCTION equipment industry ,METAL industry ,ALGORITHMS ,PRODUCTION scheduling ,WELDING ,MACHINING - Abstract
This paper focuses on a two-stage machining and welding scheduling problem based on an investigation at a structural metal manufacturing plant, aiming to minimise the total makespan. Several parts processed at Stage one according to classical job-shop scheduling are grouped into a single construction component at the second welding stage. Fabrication of the construction component cannot begin until all comprising parts have been completed at Stage one. This paper establishes a novel mathematic model to minimise the total makespan by mainly considering the dominance relationship between the construction component and the corresponding parts. In order to solve this two-stage problem, we propose an improved harmony search algorithm. A local search method is applied to the best vector at each iteration, so that a more optimal vector can be subsequently realised. The average value, minimum value, relative percentage deviation and standard deviation are discussed in the experimental section, and the proposed local best harmony search algorithm outperforms the genetic algorithm, immune algorithm and harmony search algorithm without local search. Moreover, six optimal solutions are given as Gantt charts, which vividly illustrate that the mathematical model established in this paper can facilitate the development of a better scheduling scheme. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
11. The cyclic production routing problem.
- Author
-
Manousakis, Eleftherios G., Tarantilis, Christos D., and Zachariadis, Emmanouil E.
- Subjects
SUPPLY chain management ,COMBINATORIAL optimization ,FREIGHT forwarders ,VENDOR-managed inventory ,TIME perspective ,PRODUCTION scheduling ,FREIGHT & freightage - Abstract
This paper introduces the Cyclic Production Routing Problem (CPRP). The CPRP is an extension of the well-known NP-hard Production Routing Problem (PRP), which is a hard-to-solve combinatorial optimisation problem with numerous practical applications in the field of freight transportation, logistics and supply chain management. Under the PRP setting, a manufacturer is responsible for determining production decisions, as well as the timing and quantity of replenishment services offered to a set of geographically dispersed customers over a multi-period time horizon. The problem calls for jointly optimising the production, inventory, distribution and routing decisions. In this paper, the basic PRP model is modified to generate repeatable cyclic production and delivery schedules. A two-commodity flow formulation is proposed along with valid inequalities. Extensive comparisons between the basic PRP and the proposed cyclic variant on well-known benchmark instances are provided. The new variant is significantly harder to solve, especially when the vehicle fleet is limited. From a managerial perspective, the generation of cyclic production-routing schedules significantly increases all costs, whereas the number of vehicle routes required to implement a cyclic schedule is higher. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
12. Spatial scheduling strategy for irregular curved blocks based on the modified genetic ant colony algorithm (MGACA) in shipbuilding.
- Author
-
Ge, Yan and Wang, Aimin
- Subjects
PRODUCTION scheduling ,ANT algorithms ,SHIPBUILDING ,MATHEMATICAL optimization ,ALGORITHMS ,COMPARATIVE studies - Abstract
This paper proposes a scheduling strategy for irregular curved blocks to address the complex spatiotemporal coupling scheduling problem related to the entered time, the entered sequence, the setting positions and the rotated angles for the curved blocks in a shipbuilding yard. The strategy presents a makespan-based curved blocks - classification and selection rule to fulfil the programming time for the entry of the curved blocks into the workplace and realises the suppression on the delay. Useless stepping search of curved blocks in occupied workplace is avoided by combining the lowest centre-of-gravity rule with the calculation method of the remained workplace proposed in this paper. A modified genetic ant colony algorithm was proposed, which apply the ease to premature characteristics of GA and the excellent local optimisation ability of ACO, to let and promote the algorithm falls into local optimum. Then the large-scale and full-range mutation will be implemented to make the algorithm jump out of the original local optimisation to search more local optimal solutions so that the global optimal solution can be achieved. Finally, a software system for algorithm verification was developed which conducts the comparative analysis of the algorithms and verifies the validity of the algorithm proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
13. Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions.
- Author
-
Valledor, Pablo, Gomez, Alberto, Priore, Paolo, and Puente, Javier
- Subjects
PRODUCTION scheduling ,PROBLEM solving ,PERMUTATIONS ,DECISION making ,MULTIDISCIPLINARY design optimization ,STOCHASTIC processes - Abstract
In multi-objective optimisation problems, optimal decisions need to be made in the presence of trade-offs among conflicting objectives which may sometimes be expressed in different units of measure. This makes it difficult to reduce the problem to a single-objective optimisation. Furthermore, when disruptive changes emerge in manufacturing environments, such as the arrival of new jobs or machine breakdowns, the scheduling system should be adapted by responding quickly. In this paper, we propose a rescheduling architecture for solving the problem based on a predictive-reactive strategy and a new method to calculate the reactive schedule in each rescheduling period. Additionally, we developed a methodology that allows the use of multi-objective performance metrics to evaluate dispatching rules. These rules are applied at a benchmark specifically designed for this paper considering three objective functions: makespan, total weighted tardiness and stability. Three types of disruptions are also considered: arrivals of new jobs, machine breakdowns and variations in job processing times. Results showed that the RANDOM rule provides a better behaviour compared to other evaluated rules and a lower ratio of non-dominated solutions compared to ATC (apparent tardiness cost) and FIFO (first-in-first-out) rules. Moreover, the behaviour of the hypervolume metric depends on the problem dimensions. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound.
- Author
-
Ahmadi-Javid, Amir, Haghi, Maryam, and Hooshangi-Tabrizi, Pedram
- Subjects
PRODUCTION scheduling ,CONSTRAINT programming ,LINEAR programming ,MOBILE robots ,JOB performance ,FLEXIBLE manufacturing systems - Abstract
Current studies on scheduling of machines and transporters assume that either a single transporter or an infinite number of homogeneous transporters such as AGVs or mobile robots are available to transport semi-finished jobs, which seems very restrictive in practice. This paper addresses this gap by studying a job-shop scheduling problem that incorporates a limited number of heterogeneous transporters, where the objective is to minimize the makespan. The problem is modelled using mixed-integer linear programming and constraint programming. Different structure-based branch-and-bound algorithms with two lower-bounding strategies are also developed. A comprehensive numerical study evaluates the proposed models and algorithms. The research demonstrates that the adjustment of the proposed MILP model outperforms the existing formulation when applied to the homogeneous case. The study also uncovers interesting practical implications, including the analysis of the impact of different transporter types in the system. It shows that utilizing a fleet of heterogeneous transporters can improve the overall performance of the job shop compared to a relevant homogeneous case. The importance of the study is emphasized by highlighting the negative consequences of disregarding transporters' differences during the scheduling phase. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop.
- Author
-
Liu, Lei and Urgo, Marcello
- Subjects
FLOW shops ,FLOW shop scheduling ,PRODUCTION scheduling ,VALUE at risk ,RANDOM variables - Abstract
Planning and scheduling approaches in real manufacturing environments entail the need to cope with random attributes and variables to match the characteristics of real scheduling problems where uncertain events are frequent. Moreover, the capability of devising robust schedules, which are less sensitive to the disruptive effects of unexpected events, is a major request in real applications. In this paper, a branch-and-bound approach is proposed to solve the two-machine permutation flow shop scheduling problem with stochastic processing times. The objective is the minimisation of the value-at-risk of the makespan, to support decision-makers in the trade-off between the expected performance and the mitigation of the impact of extreme scenarios. A Markovian Activity Network (MAN) model is adopted to estimate the distribution of the makespan and assess the value-at-risk for both partial and complete schedules. Phase-type distributions are used to enable general distributions for processing times while maintaining the capability to exploit a Markovian approach. The effectiveness and performance of the proposed approach are demonstrated through a set of computational experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm.
- Author
-
Paredes-Astudillo, Yenny Alexandra, Botta-Genoulaz, Valérie, and Montoya-Torres, Jairo R.
- Subjects
SIMULATED annealing ,PRODUCTION scheduling ,SCHEDULING ,ALGORITHMS ,SCHOOL schedules - Abstract
Inspired by real-life applications, mainly in hand-intensive manufacturing, the incorporation of learning effects into scheduling problems has garnered attention in recent years. This paper deals with the flowshop scheduling problem with a learning effect, when minimising the makespan. Four approaches to model the learning effect, well-known in the literature, are considered. Mathematical models are providing for each case. A solver allows us to find the optimal solution in small problem instances, while a Simulated Annealing algorithm is proposed to deal with large problem instances. In the latter, the initial solution is obtained using the well-known Nawaz-Enscore-Ham algorithm, and two local search operators are evaluated. Computational experiments are carried out using benchmark datasets from the literature. The Simulated Annealing algorithm shows a better result for learning approaches with fast learning effects as compared to slow learning effects. Finally, for industrial decision makers, some insights about how the learning effect model might affect the makespan minimisation flowshop scheduling problem are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. A column generation approach to intraday scheduling of chemotherapy patients.
- Author
-
Lyon, Gabriel, Cataldo, Alejandro, Angulo, Gustavo, Rey, Pablo A., and Sauré, Antoine
- Subjects
SCHEDULING ,CANCER chemotherapy ,PRODUCTION scheduling ,CANCER treatment ,MEDICAL protocols - Abstract
Chemotherapy scheduling at cancer treatment centres is a complex problem due to high and growing demand, diversity of treatment protocols, limitations on resources and the need to coordinate treatment session times with laboratory preparation of medication. Over a given planning horizon, treatment centres assign patients first to specific days (interday scheduling) and then to specific times within each day (intraday scheduling), the latter process including the definition of medication preparation time. This paper addresses the intraday scheduling problem using an integer programming model that attempts to schedule all patients assigned to the horizon, and the preparation of the medication to be administered, simultaneously. The linear relaxation of the model formulation, which is based on treatment patterns, is solved using column generation. The proposed approach allows for medication preparation on the day of treatment or a previous day subject to time slot availability. A case study is conducted using actual data from a Chilean cancer centre to compare through simulation the schedules generated by the proposed approach and the centre's manual method. The results show that the proposed approach performs better on makespan, treatment chair occupancy, number of overtime hours and finding solutions at high demand levels. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
18. The min–max order picking problem in synchronised dynamic zone-picking systems.
- Author
-
Saylam, Serhat, Çelik, Melih, and Süral, Haldun
- Subjects
WAREHOUSES ,DYNAMICAL systems ,TRAVEL time (Traffic engineering) ,DYNAMIC programming ,PRODUCTION scheduling ,WAREHOUSE management - Abstract
In both manual and automated warehouses, a combination of efficient zoning and picker routing plays an important role in improving travel time, congestion, and system throughput. This paper considers the order picker routing problem in a dynamic and synchronised zoning environment, where the items corresponding to each customer order are picked simultaneously in multiple zones, and zones may change between different orders. The objective is to minimise the maximum time of completing the picking activities in any zone. Using a min–max type of objective not only minimises the makespan of an order picking wave, but it also helps balance the workload of the order pickers more effectively. We present a mathematical model for the optimal solution of this problem, as well as a dynamic programming approach to find the optimal solution for the case where a zone is a set of adjacent aisles. Computational experiments on randomly generated instances show that the dynamic programming approach is able to find optimal solutions in negligible computational times. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
19. Integrated scheduling of a multi-site mining supply chain with blending, alternative routings and co-production.
- Author
-
Hilali, Hajar, Hovelaque, Vincent, and Giard, Vincent
- Subjects
SUPPLY chains ,GLOBAL optimization ,FERTILIZERS ,PRODUCTION scheduling ,CHEMICAL plants ,SCHEDULING ,STRIP mining - Abstract
This paper proposes a multi-site global optimisation model of blending operations, alternative routings and order scheduling with a co-production flow. It is performed in a phosphoric supply chain owning three open-pit mines of different geological structures and chemical compositions, each having a dry blending plant. One main challenge of the phosphate industries is to produce merchantable ores (MO) that verify a quality charter (chemical composition) with chemical heterogeneous source ores (SO). Thus, a process of SO blending followed by a treatment is mostly necessary to obtain the required MO. Six alternative routings exist to produce an MO; one of them involving a calcination plant generates a co-product. The model objective is to determine the least costly production programme of a set of MO orders to be delivered within precise time windows, in given quantities and compliance with a specific quality charter, by assigning for each MO its blending plant, routing, blend of SOs and production schedule; it also defines the feeding of the blending plants. A real case study illustrates the proposed model. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
20. An iterated greedy matheuristic for scheduling in steelmaking-continuous casting process.
- Author
-
Hong, Juntaek, Moon, Kyungduk, Lee, Kangbok, Lee, Kwansoo, and Pinedo, Michael L.
- Subjects
PRODUCTION scheduling ,SCHEDULING ,LINEAR programming ,MANUFACTURING processes ,TARDINESS ,GREEDY algorithms ,GENETIC algorithms - Abstract
Steelmaking-Continuous Casting (SCC) is a bottleneck in the steel production process and its scheduling has become more challenging over time. In this paper, we provide an extensive literature review that highlights challenges in the SCC scheduling and compares existing solution methods. From the literature review, we collect the essential features of an SCC process, such as unrelated parallel machine environments, stage skipping, and maximum waiting time limits in between successive stages. We consider an SCC scheduling problem with as objective the minimisation of the weighted sum of cast break penalties, total waiting time, total earliness, and total tardiness. We formulate the problem as a mixed-integer linear programming model and develop an iterated greedy matheuristic that solves its subproblems to find a near-optimal solution. Through numerical experiments, we show that our algorithm outperforms two types of genetic algorithms when applied to test instances. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. Multi-objective optimisation for energy-aware flexible job-shop scheduling problem with assembly operations.
- Author
-
Ren, Weibo, Wen, Jingqian, Yan, Yan, Hu, Yaoguang, Guan, Yu, and Li, Jinliang
- Subjects
PRODUCTION scheduling ,MANUFACTURING processes ,PROBLEM solving ,HEURISTIC algorithms ,ENERGY consumption - Abstract
There is a lack of studies on joint optimisation of flexible job-shop scheduling problem (FJSP) considering energy consumption and production efficiency in the machining-assembly system. Thus, in this paper, we propose a methodology for multi-objective optimisation of energy-aware flexible job-shop scheduling during machining and assembly operations. First, a mixed integrated mathematical model is developed to improve production efficiency and minimise energy consumption. Then, a novel heuristic algorithm integrated particle swarm optimisation (PSO) and genetic algorithm (GA) is developed to address the established multi-objective problem. Moreover, numerical examples are carried out to verify the validity and performance of the solving methods in achieving energy awareness in the manufacturing system. Computational results are presented to demonstrate the advantage of solving the problem compared with the exact method and common heuristic algorithms, and the trade-off between production efficiency and energy efficiency is analysed to make the final decision for managers. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
22. Industrial big-data-driven and CPS-based adaptive production scheduling for smart manufacturing.
- Author
-
Qiao, Fei, Liu, Juan, and Ma, Yumin
- Subjects
MANUFACTURING processes ,SEMICONDUCTOR manufacturing ,PRODUCTION scheduling ,SYSTEM integration ,INDUSTRY 4.0 ,CYBER physical systems ,ACQUISITION of data ,BIG data - Abstract
Smart manufacturing that involves tight integration of the physical system and cyber system is a hot topic in both industry and academia in the era of the Internet and big data. However, the dynamic and uncertain manufacturing environment introduces a significant adaptive issue of production scheduling, which is one of the pivotal tasks for smart manufacturing. This paper focuses on this problem and proposes a closed-loop adaptive scheduling solution based on the Cyber-Physical Production System (CPPS) with four phases: production data acquisition (PDA), dynamic disturbance identification (DDI), scheduling strategy adjustment (SSA), and schedule scheme generation (SSG). In the DDI phase, in view of the disturbance classification, a disturbance identification procedure based on CPPS monitoring is studied to ensure real-time response. In the SSA phase, an industrial big-data-driven scheduling strategy adjustment method is proposed, which consists of GA-based offline knowledge learning and KNN-based online adjustment, to enhance the system adaptability. We apply and verify the proposed adaptive scheduling solution on an experimental semiconductor manufacturing system, and the results demonstrate that the proposed method outperforms the dynamic scheduling method in terms of multiple objectives under different disturbance levels. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
23. Identical parallel machine scheduling with discrete additional resource and an application in audit scheduling.
- Author
-
Çanakoğlu, Ethem and Muter, İbrahim
- Subjects
PRODUCTION scheduling ,TABU search algorithm ,MATHEMATICAL models ,RESOURCE allocation ,SCHEDULING ,HEURISTIC algorithms ,AUDITING - Abstract
Resource scheduling has been one of the most prominent problems due to its technical challenges and prevalence in real-life. In this paper, we focus on an extension of the parallel machine scheduling problem with additional resources, which can be classified as a static resource-constrained parallel machine scheduling problem with unspecified job-machine assignment. The novelty of the problem we tackle stems from the additional resource that consists of components with discrete levels. The allocation of this resource to machines induces general covering constraints. This distinct characteristic of the additional resource also arises in a real-life audit scheduling problem, in which local branches of a financial firm are to be audited by a set of auditors with different experience levels. The quantification of the auditor experience and the branch experience requirement enable us to model this problem as an extension of the aforementioned scheduling problem with extra constraints related to the auditing process. We propose mathematical models for these problems and two constructive heuristic algorithms. The upper bounds attained by these algorithms are improved by a tabu-search algorithm, and an efficient lower bounding technique is developed for comparative purposes. We conduct extensive computational experiments to assess the performance of the proposed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
24. Bi-objective coordinated production and transportation scheduling problem with sustainability: formulation and solution approaches.
- Author
-
Yağmur, Ece and Kesen, Saadettin Erhan
- Subjects
PRODUCTION scheduling ,VEHICLE routing problem ,TRANSPORTATION schedules ,SUSTAINABILITY ,PARETO optimum ,TARDINESS - Abstract
This paper studies a new variant of integrated production scheduling and vehicle routing problem where production of customer orders are performed under job-shop environment and order deliveries are made by a heterogeneous fleet of vehicles, each of which is allowed to take multiple trips. Two conflicting objectives are considered, namely minimisation of the total amount of CO
2 emitted by the vehicles and minimisation of maximum tardiness resulting from late deliveries. To this end, we present a bi-objective mixed-integer programming formulation. Augmented ε-Constraint (Augmecon) method is implemented to find Pareto optimal solutions. Due to problem complexity, Augmecon cannot provide solutions even with small-sized problems. Thus, we adopt Pareto Local Search (PLS) and non-dominated sorting genetic algorithm-II (NSGA-II) for practical sized instances. For small-sized instances involving 5, 6, and 7 customers, experimental results indicate that CPU time of Augmecon are 11, 84, and 524 sec, respectively with an average number of Pareto efficient solution of 3.5. In terms of hypervolume index, Augmecon shows the best performance, followed by NSGA-II with 11.32% and PLS with 20.75% degradation for small-sized instances. For medium and large-sized instances, PLS shows worse performance than NSGA-II by 16.87% and 40.48%. [ABSTRACT FROM AUTHOR]- Published
- 2023
- Full Text
- View/download PDF
25. Robust capacity planning for sterilisation department of a hospital.
- Author
-
Gökalp, Elvan and Sanci, Ece
- Subjects
CAPACITY requirements planning ,PRODUCTION scheduling ,SERVICE departments ,HOSPITALS ,QUEUING theory - Abstract
Sterile services departments are special units designed to perform sterilisation operations in an efficient way within a hospital. The delays in sterilisation services cause significant disruptions on surgery schedules and bed management. To prevent the delays, an upper time limit can be imposed on the time spent in the sterilisation services. In this paper, we propose a mathematical modelling approach for the optimum capacity planning of a sterilisation service unit considering the uncertainties in the sterilisation process. The model aims to find the optimum capacity on four tandem steps of the sterilisation whilst at the same time minimising the total cost and keeping the maximum time in the system below a limit. Assuming general distributions for service and interarrival times, an approximation structure based on robust optimisation is used to formulate the maximum time spent in the system. We analysed the structural property of the resulting model and found that the relaxed version of the model is convex. The real data from a large sterilisation services unit is used for computational experiments. The results indicated that the approximation fits well against the simulated maximum time in the system. Other experiments revealed that an upper limit of 7 hours for the sterilisation services balances the cost vs. robustness trade-off. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
26. Permutation flow shop energy-efficient scheduling with a position-based learning effect.
- Author
-
Xin, Xu, Jiang, Qiangqiang, Li, Cui, Li, Sihang, and Chen, Kang
- Subjects
FLOW shop scheduling ,SETUP time ,OPERATING costs ,PERMUTATIONS ,PRODUCTION scheduling ,ENERGY consumption - Abstract
Severe environmental problems have made green scheduling an emerging research hotspot. In this paper, a permutation flow shop energy-efficient scheduling problem that considers multiple criteria is investigated. The aim is to find the optimal job processing sequence and conveyor speed that minimise both the makespan and total energy consumption. In addition to two types of common criteria, namely, machine-based criterion (i.e. sequence-dependent setup time) and energy-based criteria (including both the transportation time control strategy and machine shutdown strategy), a human-based criterion (i.e. a position-based learning effect) is introduced. A bi-objective programming model is developed, and a multi-objective iterated greedy (MOIG) is designed to reach the Pareto front of the model. Considering that there are two types of decisions in the model (i.e. job sequence and conveyor speed), two algorithm alternatives are designed based on the job sequence and conveyor speed, respectively. Meanwhile, an acceptance criterion with advantages in terms of the convergence speed and solution diversity is proposed. Existing algorithms, including NSGA-II and MOEA/D, are introduced to evaluate the performance of the MOIG. The results emphasise the efficiency of the MOIG. Overall, the model and MOIG effectively improve the green efficiency of enterprises and can reasonably control operating costs. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
27. Two-agent scheduling on mixed batch machines to minimise the total weighted makespan.
- Author
-
Fan, Guo-Qiang, Wang, Jun-Qiang, and Liu, Zhixin
- Subjects
BATCH processing ,PRODUCTION scheduling ,APPROXIMATION algorithms ,SCHEDULING ,MACHINERY - Abstract
This paper studies a two-agent scheduling problem on mixed batch machines in parallel. A mixed batch machine can process several jobs simultaneously as a batch, as long as the number of jobs in the batch does not exceed the machine capacity. The processing time of a mixed batch is the weighted sum of the maximum processing time and the total processing time of jobs in the batch. The objective is to minimise the weighted sum of two agents' makespans. We present four approximation algorithms based on two strategies: the machine-centric strategy and the agent-centric strategy. For each strategy, a full batch longest processing time (FBLPT) rule and a longest processing time greedy (LPTG) rule are used. We conduct theoretical analyses based on the worst-case performance ratio to provide the provable guarantees on the performances of the algorithms, and simulation analyses based on randomly generated instances to evaluate the average performances of the algorithms. Furthermore, we verify the consistency between the theoretical and simulation results. The algorithms using agent-centric strategy perform better than ones using machine-centric strategy. Finally, we provide managerial insights for the problem by analysing the technological parameters of batches, importance of agents, and demand seasonality. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
28. Flow shop scheduling with human–robot collaboration: a joint chance-constrained programming approach.
- Author
-
Wang, Duo and Zhang, Junlong
- Subjects
FLOW shop scheduling ,PRODUCTION scheduling ,COBB-Douglas production function ,RESOURCE allocation ,MANUFACTURING processes ,INDUSTRIAL robots - Abstract
Human–robot collaboration has been incorporated into production and assembly processes to promote system flexibility, changeability and adaptability. However, it poses new challenges to resource allocation and production scheduling due to its intrinsic uncertainty and also the increasing complexity of resources. This paper investigates a stochastic flow shop scheduling problem in the context of human–robot collaboration. The goal is to achieve efficient utilisation of flexible resources including human workers and cobots and take full advantage of human–robot collaboration in production scheduling. A stochastic Cobb–Douglas production function is utilised to evaluate the production efficiency of human–robot collaboration considering instabilities of human performance. A joint chance-constrained programming model is formulated to ensure that the required system performance can be achieved. A CVaR approximation-based approach is proposed to solve the formulated model with mixed-integer variables and a nonconvex constraint. The effectiveness of the formulated model and the efficiency of the proposed solution approach are evaluated via numerical experiments. Computational results show the superiority of our solution approach over three other approaches including Bonferroni approximation, scenario approach and individual chance-constrained programming. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. Production scheduling in a reconfigurable manufacturing system benefiting from human-robot collaboration.
- Author
-
Vahedi-Nouri, Behdin, Tavakkoli-Moghaddam, Reza, Hanzálek, Zdeněk, and Dolgui, Alexandre
- Subjects
MANUFACTURING processes ,PRODUCTION scheduling ,CONSTRAINT programming ,MARKET volatility ,WORKFORCE planning - Abstract
Nowadays, the manufacturing sector needs higher levels of flexibility to confront the extremely volatile market. Accordingly, exploiting both machine and workforce reconfigurability as two critical sources of flexibility is advantageous. In this regard, for the first time, this paper explores an integrated production scheduling and workforce planning problem in a Reconfigurable Manufacturing System (RMS) benefiting from reconfigurable machines and human-robot collaboration. A new Mixed-Integer Linear Programming (MILP) model and an efficient Constraint Programming (CP) model are developed to formulate the problem, minimising the makespan as the performance metric. Due to the high complexity of the problem, the MILP model cannot handle large-sized instances. Hence, to evaluate the performance of the CP model in large-sized instances, a lower bound is derived based on the relaxation of the problem. Finally, extensive computational experiments are carried out to assess the performance of the devised MILP and CP models and provide general recommendations for managers dealing with such a complex problem. The results reveal the superiority of the CP model over the MILP model in small- and medium-sized instances. Moreover, the CP model can find high-quality solutions for large-sized instances within a reasonable computational time. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. An iterated local search for customer order scheduling in additive manufacturing.
- Author
-
Zipfel, Benedikt, Neufeld, Janis, and Buscher, Udo
- Subjects
PRODUCTION scheduling ,SETUP time ,CONSUMERS ,SCHEDULING ,METAHEURISTIC algorithms ,BATCH processing - Abstract
This paper studies the customer order scheduling problem in the context of additive manufacturing. The study discusses an integrated problem involving the nesting of parts as well as the scheduling of batches of nested parts onto unrelated parallel machines. A mixed-integer programming model is presented, based on existing formulations from the literature, that integrates different materials and sequence-dependent setup times. Additionally, a metaheuristic based on an iterated local search is proposed for the problem configuration under consideration. Focusing on minimizing the total weighted tardiness of orders, the efficiency of the heuristic approach is evaluated using comprehensive test data. Further, we show the importance of the considered order-related objective by using qualitative analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Scheduling in Industrial environment toward future: insights from Jean-Marie Proth.
- Author
-
Khakifirooz, Marzieh, Fathi, Michel, Dolgui, Alexandre, and Pardalos, Panos M.
- Subjects
PRODUCTION scheduling ,SCHEDULING ,RESEARCH personnel ,ENGINEERING equipment ,METHODS engineering - Abstract
According to [Dolgui, Alexandre, and Jean Marie Proth. 2010. Supply Chain Engineering: Useful Methods and Techniques. Vol. 539. Springer.], advancing tactical levels in production systems has led to the disappearance of static scheduling in favour of dynamic scheduling. Additionally, the evolving challenges in the supply chain paradigm have significantly impacted the organisation of production systems. This shift has moved scheduling issues from the tactical to the strategic level, resulting in linear organisations encompassing scheduling decisions. [Proth, Jean Marie. 2007. "Scheduling: New Trends in Industrial Environment." Annual Reviews in Control 31 (1): 157–166. .] emphasised that real-time scheduling in production systems has become a pivotal area of research. He presented several open problems for researchers to address in this context, including (1) the development of real-time algorithms capable of handling multiple operations on the same product and unrelated resources, (2) adapting previous schedules with certain modifications, (3) addressing unforeseen actions that arise randomly in real-time planning, and (4) exploring cyclic scheduling problems with size limits as alternative solutions to heuristic approaches. This paper reviews the evolving trends in light of J.M. Proth's predictions and advice within the aforementioned domains. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Modeling and analysis of a new production methodology for achieving mass customization.
- Author
-
Singh, Sanchit and Sarin, Subhash C.
- Subjects
MASS customization ,PRODUCTION scheduling ,LEAD time (Supply chain management) ,INDUSTRIAL costs ,PRODUCTION control ,JOB shops - Abstract
In this paper, we address a Stochastic-Demand Assembly Job Shop Scheduling Problem (SD-AJSSP) in the presence of the commonality of sub-assemblies across products. We propose a new production methodology, named Assemble-to-Order with Commonality of Sub-Assemblies (ATO-CS) to not only solve the SD-AJSSP, but also, achieve a successful implementation of a mass customisation system by collectively aiming to (1) keep the production costs low by leveraging upon commonality of sub-assemblies in products' BOM and producing sub-assemblies on a mass scale during one of the two stages of production, (2) minimise the loss due to excess inventory build-up in anticipation of stochastic demand of products by postponing the production of certain apex sub-assemblies in products' BOM until the actual demand is realised, and (3) reduce the time of the products' delivery to customers. The ATO-CS method determines optimum production levels as well as schedules assembly operations/jobs over the machines at each stage of production, where the second stage is an assembly job shop and is shown to outperform commonly-used production methodologies. We also develop an algorithm for its implementation and show its efficacy over the use of the state-of-the-art commercial solver CPLEX® in obtaining a lower solution cost and smaller optimality gap. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Retrieval sequencing in autonomous vehicle storage and retrieval systems.
- Author
-
Yugang Yu, Jingjing Yang, and Xiaolong Guo
- Subjects
AUTOMATED storage retrieval systems ,AUTONOMOUS vehicles ,DYNAMIC programming ,PRODUCTION scheduling ,HEURISTIC ,STORAGE - Abstract
Autonomous vehicle storage and retrieval systems (AVS/RSs) are widely used in e-commerce warehouses due to their high throughput and flexibility. In such systems, storage and retrieval transactions are performed by lifts and vehicles. This paper focuses on the sequencing retrievals problem in an AVS/RS, which is an important problem for daily operations. We formulate this sequencing problem as a mixed-integer program to determine a retrieval sequence for the lift and the vehicles, one that minimises the makespan. A dynamic programming approach is proposed to solve the sequencing problem to optimality. However, the solution time of the dynamic programming method is exponentially increasing in the number of retrieval requests. To be more practical, we present a beam search heuristic that can solve large-sized instances in reasonable time. Computational experiments verify that near-optimal solutions can be found by the beam search heuristic. Compared to commonly used heuristics and straightforward heuristics, the beam search decreases the makespan by up to 15%. Finally, we analyse how vehicle modes impact the makespan, showing evidence that a small makespan can be achieved when considering a realistic mode of vehicles. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
34. A new two-stage constraint programming approach for open shop scheduling problem with machine blocking.
- Author
-
Abreu, Levi R., Nagano, Marcelo S., and Prata, Bruno A.
- Subjects
CONSTRAINT programming ,RETAIL store openings ,JOB shops ,LINEAR programming ,NP-hard problems ,INTEGER programming ,SHIFT systems - Abstract
In this paper, a variant of the open shop scheduling problem is considered in which the intermediate storage is forbidden among two adjacent production stages (zero buffer or machine blocking constraint). The performance measure is to minimise the maximal completion time of the jobs (makespan). Since this is an NP-hard problem, a two-stage constraint programming approach is proposed as a new exact method. Computational experiments were carried out on 222 literature problem instances in order to test the performance of the proposed algorithm. The relative deviation is adopted as the performance criteria. Computational results point to the ability of the proposed method to solve large-sized instances in comparison with the developed mixed-integer linear programming model and a simple constraint programming model, both with user cuts. In all set of instances, the proposed two-stage method performed better than benchmarking methods and integer programming models, with average relative deviation regarding objective values as lower as 12%. In addition, the results point to a competitive efficiency in computational times of the proposed method with less than 200 s in the most instances to obtain the optimal solution, in comparison to competitive metaheuristics from literature of the problem, for the tested test instances. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
35. A framework for production planning in additive manufacturing.
- Author
-
De Antón, Juan, Villafáñez, Félix, Poza, David, and López-Paredes, Adolfo
- Subjects
PRODUCTION planning ,LITERATURE reviews ,PRODUCTION scheduling ,MANUFACTURING processes ,ORDER picking systems - Abstract
Additive manufacturing (AM) introduces a set of technology-specific problems, such as the proper orientation of parts or the placement of several heterogeneous parts in the same build cycle, which are not addressed by traditional approaches to production planning and scheduling. Although these new production subproblems have been implicitly addressed by several works according to generic nesting and scheduling concepts, a literature review revealed that there is no uniformity in identifying and, thus, solving all these subproblems. For this reason, and as a result of an in-depth analysis of the existent literature on AM production planning and an analogy with classic cutting and packing typologies, the present paper offers a framework to formalise the production planning problem in AM at the operational level. This framework can be used as a reference to focus on and address these AM-related problems for efficient production planning. It is designed at the subproblem level and centres on production order processing in AM. A coding strategy is specifically developed for the framework, which is applied to a review of relevant works that propose models for the production planning of AM systems. Finally, the review results are discussed and possible extensions of the framework are proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
36. Comparison of pull management policies for a divergent process with DDMRP buffers: an industrial case study.
- Author
-
Dessevre, Guillaume, Lamothe, Jacques, Pellerin, Robert, Ali, Maha Ben, Baptiste, Pierre, and Pomponne, Vincent
- Subjects
PRODUCTION planning ,PRODUCTION scheduling ,GENERIC products ,WORK in process ,CUSTOMER services - Abstract
Production planning and scheduling for companies with divergent processes, where a single component can be transformed into several finished products, are challenging as planners might face material misallocation issues. In this paper, we address the problem of managing a divergent process with DDMRP stock buffers, where different finished products are bottled with the same component having a fixed batch size. An allocation decision needs to be made to determine the quantities of finished products to be bottled. This study is motivated by a real-life problem faced by a dermo-cosmetic company. We compare and analyze by simulation nine different policies triggering allocation decisions. The first policy is the classic DDMRP rule, while the others are new policies, including a virtual buffer of a generic finished product and ConWIP loops, delaying the allocation decision. Our results show that the policy combining the classic DDMRP rule and a ConWIP loop surrounding a part of the process reduces the work-in-process by 34% compared to the classic DDMRP while ensuring high customer service rates and control of flow times. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
37. Optimisation methods in production, maintenance and logistics.
- Author
-
Chelbi, Anis and Rezg, Nidhal
- Subjects
INDUSTRIAL efficiency ,INVENTORY control ,PRODUCTION scheduling - Abstract
An introduction is presented for this issue which includes research papers from the 8th MOSIM international conference that focus on topics such as theory and practice related to optimisation methods in manufacturing, inventory control, and stochastic machine scheduling.
- Published
- 2012
- Full Text
- View/download PDF
38. Crowdsource-enabled integrated production and transportation scheduling for smart city logistics.
- Author
-
Feng, Xin, Chu, Feng, Chu, Chengbin, and Huang, Yufei
- Subjects
PRODUCTION scheduling ,TRANSPORTATION schedules ,PROBLEM solving ,SMART cities ,GENETIC algorithms ,LOGISTICS - Abstract
With city logistics becoming more and more important, increasing attention has been paid to the 'last-mile delivery' in urban areas. We investigate a novel crowdsource-enabled integrated production and transportation scheduling problem in the paper. The problem is first formulated into a mixed-integer linear program and its strong NP-hardness is proved. To better understand this complex problem, two sub-problems: a production and transportation scheduling problem and a crowdsourced bid selection problem are analysed. Based on problem properties, a Genetic Algorithm (GA) and a lower bound (LB) are developed to solve the original problem. Experimental results with up to 100 customers show that the GA outperforms the well-known commercial MIP solver CPLEX. Especially, (1) the GA can yield near-optimal solutions for all the tested instances with an average gap of 10.17% from the lower bound, while CPLEX provides feasible solutions only for instances with no more than 30 customers; (2) the average computation time of the GA is only 0.93% of that required by CPLEX; Besides, sensitivity analysis demonstrates advantages of introducing crowdsourced delivery into city logistics. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
39. Minimising total completion time on single-machine scheduling with new integrated maintenance activities.
- Author
-
Chung, Tsui-Ping, Xue, Zhen, Wu, Tong, and Shih, Stephen C.
- Subjects
COMPUTER scheduling ,SEMICONDUCTOR wafer manufacturing ,PRODUCTION scheduling ,HEURISTIC ,SEMICONDUCTORS - Abstract
A single-machine scheduling problem with new maintenance activities is examined in this paper. In the scheduling literature, it is often assumed that the interval between maintenance activities is fixed or within a specified time frame. However, this assumption may not hold true in many real-world situations, such as the maintenance activities in wafer manufacturing of semiconductor. Before the wafer manufacturing process starts, it is imperative that the wafers go through a number of cleaning operations to avoid contamination. Using a cleaning agent as the main material of wafer cleaning, the contamination will be dissolved and removed from wafer surface. In case of contamination being accumulated substantial and going beyond a permitted value, the cleaning agent is highly likely to damage the wafer surfaces. Thus, the interval between maintenance activities in the wafer manufacturing process is deemed irregular. The objective function of the proposed problem is to minimise total completion time. Addressing the problem, a binary integer programming model is formulated in this paper. Furthermore, with the research problem being NP-hard, a heuristic based on two special properties is proposed to address the problem. To evaluate and validate the proposed heuristic, a new lower bound is further developed. Extensive experiments have been conducted showing that the proposed heuristic efficiently yields a near-optimal solution with an average percentage error of 15.4 from lower bound. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
40. Scheduling a storage-augmented discrete production facility under incentive-based demand response.
- Author
-
Weitzel, Timm and Glock, Christoph H.
- Subjects
PRODUCTION scheduling ,PARATRANSIT services ,RENEWABLE energy sources ,AUGMENTED reality ,INDUSTRIAL productivity ,CAPITAL productivity - Abstract
Demand response (DR) is considered as one of the most important measures for balancing energy supply and demand in the smart grid paradigm. Incentive-based programs, one manifestation of DR, contribute to short-term system stability and prevent critical periods when system stability is at risk by enabling the system operator (SO) to directly change total energy demand. The fact that a third party would be empowered to interfere with internal operations is, however, also one of the major drawbacks of DR that prevents especially industrial consumers from participating with full capacity in such programs. This paper considers an alternative Incentive-based program with application to a discrete manufacturing facility where load reduction curves (LRCs) are generated a priori outlining the potential load reduction in the DR period. The SO uses the LRC to determine the desired level of load reduction for critical periods. To illustrate the generation of the LRC, this paper builds on a flexible flow shop (FFS) formulation for a discrete manufacturing facility and presents a model that includes multiple machine modes and product- and machine-specific energy consumption trajectories. Based on the FFS, a procedure is developed to generate the LRC. The paper also investigates the potential of including a battery energy storage system (BESS) into the production facility and illustrates the effects of the BESS on the LRC. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
41. An integrated model for multi-resource constrained scheduling problem considering multi-product and resource-sharing.
- Author
-
Liu, Changchun, Xiang, Xi, Zheng, Li, and Ma, Jing
- Subjects
SUPPLY chain management ,PRODUCTION scheduling ,INFORMATION sharing ,MANUFACTURING industries ,MIXED integer linear programming ,HEURISTIC algorithms - Abstract
This paper studies a multi-resource constrained scheduling problem considering multi-product and resource-sharing in the manufacturing supply chain, in which many independent production units coordinate with a truck resource manager. A mixed integer programming model is formulated to minimise the total system cost and some analytical properties are proposed to tighten the model. A Lagrangian relaxation-based heuristic with several enhancements, e.g. warm startup, approximating solve and parallel computation of subproblems, is proposed to solve the model. Finally, computational experiments are conducted to verify that (i) the proposed method has a better performance in both objective and CPU time than CPLEX, (ii) all three enhancements can help reduce the total computation time and (iii) a certain degree of resource-sharing can help reduce the total cost of the system. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
42. Joint optimisation for dynamic flexible job-shop scheduling problem with transportation time and resource constraints.
- Author
-
Ren, Weibo, Yan, Yan, Hu, Yaoguang, and Guan, Yu
- Subjects
PRODUCTION scheduling ,FLEXIBLE manufacturing systems ,MANUFACTURING processes ,TRANSPORTATION schedules ,MATHEMATICAL optimization - Abstract
Dynamic flexible job-shop scheduling is traditionally a challenge in real-world manufacturing systems, especially considering the constraints of transportation resources and transportation time. To address the dynamic optimisation problem in flexible manufacturing systems, this paper proposes a novel proactive-reactive methodology to adapt to the dynamic changes in working environments and addresses the joint scheduling problem for machine tools and transportation resources. The joint optimisation model is first formulated as a mixed-integer programming model considering production efficiency and transportation constraints. The flowchart of the dynamic scheduling system is then designed for dynamic decision-making, and a novel particle swarm optimisation algorithm integrated with genetic operators is developed to respond to dynamic events and generate the reschedule plan in time. Finally, several numerical experiments and case studies in reality are applied to verify the efficiency of the developed methodology. Common dispatching rules and heuristic methods are also applied to test and evaluate the efficiency of the developed algorithm. Computational results demonstrate that the developed methods and decision models are efficient for dynamic job-shop scheduling problems in flexible manufacturing systems, which can acquire rather a good effect in practical production. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
43. Transfer-robot task scheduling in job shop.
- Author
-
Ham, Andy
- Subjects
PRODUCTION scheduling ,CONSTRAINT programming ,JOB shops ,WAREHOUSES ,SHARED workspaces - Abstract
This paper studies a simultaneous scheduling of production and material transfer in a job shop environment. The simultaneous scheduling approach has been recently adopted by warehouse operations, wherein transbots pick up jobs and deliver to pick-machines for processing that requires a simultaneous scheduling of jobs, transbots, and machines. However, both a large proportion of literature and real-world scheduling systems consider only one side of the problem. In our study, machines and transbot are both considered as constraining resources. The contributions of this paper are twofold. First, we propose a novel application of constraint programming for the job shop scheduling problem (JSP) with transbots, significantly outperforming all other benchmark approaches in the literature and proving optimality of the well-known benchmark instances, for the first time. Second, we propose a medium-scale benchmark instance. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
44. Flexible flow line scheduling considering machine eligibility in a digital dental laboratory.
- Author
-
Valizadeh, Siavash, Fatahi Valilai, Omid, and Houshmand, Mahmoud
- Subjects
DENTAL laboratories ,CAD/CAM systems ,PRODUCTION planning ,PRODUCTION scheduling ,ALGORITHMS ,3-D printers ,METAHEURISTIC algorithms - Abstract
Introduction of digital solutions has made dentistry more efficient and effective in response to patients' demands. Moreover, digital solution helps participants to manage daily workflow simpler than traditional practices. Scanners, CAD/CAM software, CNC machines and 3D printers are components of digital solutions in current dentistry. Responding to patients as quickly as possible is essential in medical fields and dentistry has similar situations. On the other hand, demands in dentistry are highly customized that it makes managing orders more difficult because each order needs special design and production. Thus, this paper assesses orders in digital dentistry and develops a mathematical model to optimize production planning and scheduling of orders by considering different objectives and requirements that are common in dentistry. In addition, a metaheuristics algorithm was developed based on PSO to respond to NP-hard challenges of the model. The developed algorithm includes two steps that PSO metaheuristics consider in the second step to search new solutions. Finally, through case studies, performance of the developed model and proposed algorithm was investigated. Developed algorithm generates solutions with proper quality considering makespan and total completion time objectives and required time to obtain a solution with high quality depends on problem data and can increase. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
45. Filter-and-fan approaches for scheduling flexible job shops under workforce constraints.
- Author
-
Müller, David and Kress, Dominik
- Subjects
PRODUCTION scheduling ,CONSTRAINT programming ,LABOR supply - Abstract
This paper addresses a flexible job shop scheduling problem that takes account of workforce constraints and aims to minimise the makespan. The former constraints ensure that eligible workers that operate the machines and may be heterogeneously qualified, are assigned to the machines during the processing of operations. We develop different variants of filter-and-fan (F&F) based heuristic solution approaches that combine a local search procedure with a tree search procedure. The former procedure is used to obtain local optima, while the latter procedure generates compound transitions in order to explore larger neighbourhoods. In order to be able to adapt neighbourhood structures that have formerly shown to perform well when workforce restrictions are not considered, we decompose the problem into two components for decisions on machine allocation and sequencing and decisions on worker assignment, respectively. Based on this idea, we develop multiple definitions of neighbourhoods that are successively locked and unlocked during runtime of the F&F heuristics. In a computational study, we show that our solution approaches are competitive when compared with the use of a standard constraint programming solver and that they outperform state-of-the-art heuristic approaches on average. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
46. A novel feature selection for evolving compact dispatching rules using genetic programming for dynamic job shop scheduling.
- Author
-
Shady, Salama, Kaihara, Toshiya, Fujii, Nobutada, and Kokuryo, Daisuke
- Subjects
PRODUCTION scheduling ,GENETIC programming ,FEATURE selection ,DYNAMIC programming ,MACHINE learning ,DISCRETE event simulation - Abstract
Because of advances in computational power and machine learning algorithms, the automated design of scheduling rules using Genetic Programming (GP) is successfully applied to solve dynamic job shop scheduling problems. Although GP-evolved rules usually outperform dispatching rules reported in the literature, intensive computational costs and rule interpretability persist as important limitations. Furthermore, the importance of features in the terminal set varies greatly among scenarios. The inclusion of irrelevant features broadens the search space. Therefore, proper selection of features is necessary to increase the convergence speed and to improve rule understandability using fewer features. In this paper, we propose a new representation of the GP rules that abstracts the importance of each terminal. Moreover, an adaptive feature selection mechanism is developed to estimate terminals' weights from earlier generations in restricting the search space of the current generation. The proposed approach is compared with three GP algorithms from the literature and 30 human-made rules from the literature under different job shop configurations and scheduling objectives, including total weighted tardiness, mean tardiness, and mean flow time. Experimentally obtained results demonstrate that the proposed approach outperforms methods from the literature in generating more interpretable rules in a shorter computational time without sacrificing solution quality. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
47. Scheduling policies analysis for matching operations in Bernoulli selective assembly lines.
- Author
-
Shen, Xiaoxiao and Li, Na
- Subjects
ASSEMBLY line methods ,POLICY analysis ,MARKOV processes ,SCHEDULING ,PRODUCT quality ,PRODUCTION scheduling - Abstract
In a selective assembly system, mismatched products can pass inspections due to the flexibility of product quality grades. However, they will be sold at discounted prices leading to a revenue decline. Hence, it is critical to design an appropriate scheduling policy for better matching to maximise the system quality-related revenue. In this paper, we propose a Waiting for Closest Quality Matching Policy (WCQMP), which allows postponing the assembly process within the waiting threshold. And once the postpone is finished, the closest quality parts will be selected to match. The other two policies, Random Matching Policy (RMP) and Closest Quality Matching Policy (CQMP), are also proposed as comparisons. We construct Markov chain models for small systems and develop approximation methodologies for larger systems to analyze the performance under the policies. Comparisons of different scheduling policies and the performance analysis of WCQMP are carried out in numerical studies. Our findings indicate that nearly in all the systems, WCQMP, CQMP performs better than RMP. And when system and policy parameters are properly designed, WCQMP is more superior by improving assembly quality without overly sacrificing system throughput, thereby increasing quality-related revenue. Managerial insights are also provided for industrial practitioners to apply WCQMP more appropriately. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. Adaptive selection multi-objective optimization method for hybrid flow shop green scheduling under finite variable parameter constraints: case study.
- Author
-
Liu, Zhifeng, Yan, Jun, Cheng, Qiang, Chu, Hongyan, Zheng, Jigui, and Zhang, Caixia
- Subjects
FLOW shop scheduling ,PRODUCTION scheduling ,CONTINUOUS processing ,FURNACES ,FLOW shops ,MAXIMUM power point trackers - Abstract
The energy consumption loss is high particularly in manufacturing processes involving heating furnaces. Moreover, the mandatory constraints in continuous heating stage bring difficult challenges to production scheduling. To improve the production efficiency and reduce the energy consumption in a hybrid flow shop with continuous and discrete processing stages, this study developed an adaptive selection multi-objective optimization algorithm with preference (ASMOAP). The mandatory constraints of continuous processing stage are transformed into one of the optimization objectives, which is defined as maximum excess value of adjustment time in this paper. A multi-objective optimization scheduling model with the makespan, energy consumption, and maximum excess of adjustment time is established. The optimization preference is designed in the proposed multi-objective optimization algorithm. The maximum excess of adjustment time is set as the multi-objective optimization preference. Three adaptive selection strategies are designed for the algorithm based on the proportions of outstanding and preference individuals to eliminate constraint conflicts. Presented results prove that the proposed algorithm could effectively solve hybrid flow shop scheduling problem considering discrete and continuous processing stages with limited time. It can be applied to obtain a better feasible solution while improving the efficiency and reducing the energy consumed in practical production processes. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
49. Level-based multi-objective particle swarm optimizer for integrated production scheduling and vehicle routing decision with inventory holding, delivery, and tardiness costs.
- Author
-
Long, Jianyu, Pardalos, Panos M., and Li, Chuan
- Subjects
PRODUCTION scheduling ,TARDINESS ,VEHICLE routing problem ,INVENTORY costs ,MATHEMATICAL optimization - Abstract
Integrated optimisation of production scheduling and distribution decision is necessary for reducing the whole cost of the supply chain in the make-to-order business environment. This paper studies a new integrated production scheduling and vehicle routing problem (IPSVRP) with inventory holding, delivery, and tardiness costs. The considered IPSVRP is modelled as a triple-objective optimisation problem, where the first objective aims to obtain the minimal total holding cost in the inventory, the second one attempts to achieve the minimal total travelling cost, and the third one tries to acquire the minimal total tardiness cost. To obtain a set of diverse non-dominated solutions in the Pareto-optimal front of the problem, we first derive several key structural properties used to provide necessary conditions for any solution to be Pareto-optimal through theoretical investigation. Based on the derived structural properties, a level-based multi-objective particle swarm optimizer (LMPSO) is subsequently designed. The performance of LMPSO is analysed by conducting a set of experiments, and its superiority is verified through comparing with other optimisation algorithms. Moreover, the convergence behaviour of LMPSO is also investigated, and the experimental results prove that it has the ability to achieve a set of non-dominated solutions proximity to the true Pareto front. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
50. A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations.
- Author
-
Fan, Jiaxin, Zhang, Chunjiang, Shen, Weiming, and Gao, Liang
- Subjects
PRODUCTION scheduling ,FLOW shops ,MIXED integer linear programming ,MATHEMATICAL programming ,GENETIC algorithms - Abstract
Multi-variety and small-batch production mode enables manufacturing industries to expeditiously satisfy customers' personalised demands, where a large amount of identical jobs can be split into several sublots, and be processed by reconfigurable machines with multiple machining technics. However, such highly flexible manufacturing environments bring some intractable problems to the production scheduling. Mathematical programming and meta-heuristic methods become less efficient when a scheduling problem contains both discrete and continuous optimisation attributes. Therefore, matheuristic, which combines advantages of the two methodologies, is regarded as a promising solution. This paper investigates a flexible job shop scheduling problem with lot-streaming and machine reconfigurations (FJSP-LSMR) for the total weighted tardiness minimisation. First, a monolithic mixed integer linear programming (MILP) model is established for the FJSP-LSMR. Afterwards, a matheuristic method with a variable neighbourhood search component (MH-VNS) is developed to address the problem. The MH-VNS adopts the classical genetic algorithm (GA) as the framework, and introduces two MILP-based lot-streaming optimisation strategies, LSO1 and LSO2, to improve lot-sizing plans with varying degrees. Four groups of instances are extended from the well-known Fdata benchmark to evaluate the performance of proposed MILP model, LSO1 and LSO2 components, and MH-VNS. Numerical experimental results suggest that LSO1 and LSO2 are efficient in different scenarios, and the proposed MH-VNS can well balance the solution quality and computational costs for reasonably integrating the GA- and MILP-based local search strategies. In addition, a complicated FJSP-LSMR case is abstracted from a real-world shop floor for processing large-sized structural parts to further validate the MH-VNS. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.