Performance of scheduling algorithms for no-wait flowshops with parallel machines

DOI10.1016/0377-2217(93)90248-LzbMath0803.90078MaRDI QIDQ1310022

Chelliah Skriskandarajah

Publication date: 3 January 1995

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

zbMATH Keywords

heuristicsparallel machinesno-wait flowshopminimum finish time scheduletwo center flowshopworst case analyses

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Some no-wait shops scheduling problems: Complexity aspect ⋮ Scheduling semiconductor in-line steppers in new product/process introduction scenarios ⋮ A cutting and scheduling problem in float glass manufacturing ⋮ Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility ⋮ A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. ⋮ Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. ⋮ Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations ⋮ Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time ⋮ The hot strip mill production scheduling problem: A tabu search approach

Cites Work

• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Some no-wait shops scheduling problems: Complexity aspect
• No-wait shop scheduling: Computational complexity and approximate algorithms
• On pedigree polytopes and Hamiltonian cycles
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Evaluation of a MULTIFIT-based scheduling algorithm
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Flowshop and Jobshop Schedules: Complexity and Approximation
• An Application of Bin-Packing to Multiprocessor Scheduling
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Performance of scheduling algorithms for no-wait flowshops with parallel machines