Two-machine group scheduling problem with blocking and anticipatory setups
From MaRDI portal
Publication:1309970
DOI10.1016/0377-2217(93)90029-MzbMath0784.90039MaRDI QIDQ1309970
Rasaratnam Logendran, Chelliah Skriskandarajah
Publication date: 6 January 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
makespanworst-case performanceNP-hardheuristicflowshopjust-in-time manufacturingtwo-machine group scheduling
Related Items
A comprehensive review of flowshop group scheduling literature ⋮ A bicriteria flowshop scheduling problem with setup times ⋮ Total flowtime in no-wait flowshops with separated setup times. ⋮ Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. ⋮ A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem ⋮ A new heuristic and dominance relations for no-wait flowshops with setups ⋮ A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Mixed integer linear programming models for flow shop scheduling with a demand plan of job types ⋮ A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups ⋮ Group scheduling on two cells with intercell movement ⋮ Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups ⋮ Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm ⋮ A review of TSP based approaches for flowshop scheduling
Cites Work
- Unnamed Item
- Grouping of parts and components in flexible manufacturing systems
- Optimal two- and three-stage production schedules with setup times included
- Integrated design of cellular manufacturing systems in the presence of alternative process plans
- A graph partitioning procedure for machine assignment and cell formation in group technology†
- A method for finding minimal bottle-neck cells for grouping part-machine families†
- ZODIAC—an algorithm for concurrent formation of part-families and machine-cells
- Flowshop scheduling with limited temporary storage
- The Complexity of Flowshop and Jobshop Scheduling
- On non-permutation solutions to some two machine flow shop scheduling problems
- Sequencing n jobs on two machines with setup, processing and removal times separated
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
