Two-machine group scheduling problem with blocking and anticipatory setups

DOI10.1016/0377-2217(93)90029-MMaRDI QIDQ1309970zbMATH OpenFDO

Authors Rasaratnam Logendran, Chelliah Sriskandarajah

Publication date 6 January 1994

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(93)90029-M

zbMATH Keywords

flowshopheuristicjust-in-time manufacturingmakespanNP-hardtwo-machine group schedulingworst-case performance

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
• Two-machine flowshop batching and scheduling
• Group technology approach to the open shop scheduling problem with batch setup times
• The complexity of two group scheduling problems
• Two-machine flowshop group scheduling problem

Cites work

• A graph partitioning procedure for machine assignment and cell formation in group technology†
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Flowshop scheduling with limited temporary storage
• Grouping of parts and components in flexible manufacturing systems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Integrated design of cellular manufacturing systems in the presence of alternative process plans
• On non-permutation solutions to some two machine flow shop scheduling problems
• Optimal two- and three-stage production schedules with set-up time included
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Sequencing n jobs on two machines with setup, processing and removal times separated
• The Complexity of Flowshop and Jobshop Scheduling
• ZODIAC—an algorithm for concurrent formation of part-families and machine-cells

Cited in

(15)

• Efficient solutions to the cell-formation problem with multiple routings via a double-loop genetic algorithm
• 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 heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
• A comprehensive review of flowshop group scheduling literature
• A hybrid metaheuristic approach for minimizing the total flow time in a flow shop sequence dependent group scheduling problem
• Mixed integer linear programming models for flow shop scheduling with a demand plan of job types
• A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
• Group scheduling on two cells with intercell movement
• Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups
• A review of TSP based approaches for flowshop scheduling
• Flowshop-scheduling problems with makespan criterion: a review
• A new heuristic and dominance relations for no-wait flowshops with setups
• A multi-objective memetic algorithm for energy-efficient flow shop group scheduling problem with a dynamic speed-scaling mechanism
• A bicriteria flowshop scheduling problem with setup times

This page was built for publication: Two-machine group scheduling problem with blocking and anticipatory setups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309970)