A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
New formulation for scheduling flexible flow shop problems
This research extends the constrained vehicle routing problem concept to solve flexible flow shop scheduling problems. Mixed-integer linear programming and constraint programming formulations are developed for a flow shop problem with no-wait, time lags and release time restrictions to minimize the makespan in both permutation and non-permutation schedules. The comparative analysis of various models reveals that constraint programming models have superior computational performance than mixed-integer linear programming models. However, the mixed-integer linear programming models are also timely-efficient. Moreover, the efficiency of developed models is also represented in comparison with several benchmark datasets. Based on the findings, while the objective function values of the mixed-integer linear programming and constraint programming models in non-permutation schedules exhibit lower values than their respective equivalents in permutation schedules, both models demonstrate longer runtime in non-permutation schedules. Results represent that the proposed constraint programming and mixed-integer linear programming models are among the top three models of the benchmark datasets in terms of the number of decision variables and computational performance. One of the limitations of the research is that there is no comprehensive dataset in the literature considering all the restrictions in permutation and non-permutation schedules.
New formulation for scheduling flexible flow shop problems
This research extends the constrained vehicle routing problem concept to solve flexible flow shop scheduling problems. Mixed-integer linear programming and constraint programming formulations are developed for a flow shop problem with no-wait, time lags and release time restrictions to minimize the makespan in both permutation and non-permutation schedules. The comparative analysis of various models reveals that constraint programming models have superior computational performance than mixed-integer linear programming models. However, the mixed-integer linear programming models are also timely-efficient. Moreover, the efficiency of developed models is also represented in comparison with several benchmark datasets. Based on the findings, while the objective function values of the mixed-integer linear programming and constraint programming models in non-permutation schedules exhibit lower values than their respective equivalents in permutation schedules, both models demonstrate longer runtime in non-permutation schedules. Results represent that the proposed constraint programming and mixed-integer linear programming models are among the top three models of the benchmark datasets in terms of the number of decision variables and computational performance. One of the limitations of the research is that there is no comprehensive dataset in the literature considering all the restrictions in permutation and non-permutation schedules.
New formulation for scheduling flexible flow shop problems
Int J Interact Des Manuf
Esmaelian, Majid (author) / Mohammadi, Milad (author) / Shahmoradi, Hadi (author)
2023-12-01
15 pages
Article (Journal)
Electronic Resource
English
Flexible flow shop , Mixed integer linear programming , Constraint programming , Constrained vehicle routing problem Engineering , Engineering, general , Engineering Design , Mechanical Engineering , Computer-Aided Engineering (CAD, CAE) and Design , Electronics and Microelectronics, Instrumentation , Industrial Design
A new genetic algorithm for flexible job-shop scheduling problems
| British Library Online Contents | 2015
Combining Heuristics and Machine Learning for Hybrid Flow Shop Scheduling Problems
| BASE | 2020
Exploring the scheduling problems in a flow shop environment via simulation
| British Library Online Contents | 1996
Exploring the scheduling problems in a flow shop environment via simulation
| British Library Online Contents | 1996
Analysis of dispatching rules application on scheduling problem in flexible-flow shop production
| DOAJ | 2014