The evolution of schematic representations of flow shop scheduling problems
From MaRDI portal
Publication:2304109
DOI10.1007/s10951-018-0594-9zbMath1442.90084OpenAlexW2905473596MaRDI QIDQ2304109
Shrikant S. Panwalkar, Christos P. Koulamas
Publication date: 6 March 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-018-0594-9
Related Items
Cites Work
- Unnamed Item
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Complexity results for flow shop problems with synchronous movement
- The no-wait flow-shop paradox
- On no-wait and no-idle flow shops with makespan criterion
- A fast tabu search algorithm for the permutation flow-shop problem
- A two-machine permutation flow shop scheduling problem with buffers
- Approximation methods for discrete lot streaming in flow shops
- Gantt charts: A centenary appreciation.
- An ant colony system for permutation flow-shop sequencing
- The permutation flow shop with buffers: A tabu search approach
- A comprehensive review of flowshop group scheduling literature
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Job-shop scheduling with blocking and no-wait constraints
- The hybrid flow shop scheduling problem
- A review of TSP based approaches for flowshop scheduling
- Optimal two- and three-stage production schedules with setup times included
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Scheduling of a Two-machine Flowshop with Travel Time Between Machines
- Scheduling Parts in a Combined Production-transportation Work Cell
- Flowshop scheduling with limited temporary storage
- The Lessons of Flowshop Scheduling Research
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop sequencing problem with ordered processing time matrices: A general case
- The Complexity of Flowshop and Jobshop Scheduling
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- Letter to the Editor—A Comment on the Shortest-Route Problem
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
- Flowshop-scheduling problems with makespan criterion: a review
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Scheduling
- Machine scheduling with transportation considerations
