Efficiency of reductions of job-shop to flow-shop problems

DOI10.1016/S0377-2217(99)00389-6zbMath0967.90046MaRDI QIDQ1582031

Alain Guinet

Publication date: 3 September 2001

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

zbMATH Keywords

heuristicsschedulingflow-shopjob-shop environmentextension Johnson's rule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Flowshop-scheduling problems with makespan criterion: a review

Cites Work

• Unnamed Item
• The one-machine sequencing problem
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• Applying tabu search to the job-shop scheduling problem
• Optimal two- and three-stage production schedules with setup times included
• Sequency on two and three machines with setup, processing and removal times separated
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Survey of Scheduling Rules
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: Efficiency of reductions of job-shop to flow-shop problems