Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

DOI10.1016/S0377-2217(99)00253-2zbMath0967.90044OpenAlexW2054432571MaRDI QIDQ1569925

Inna G. Drobouchevitch, Vitaly A. Strusevich

Publication date: 3 September 2001

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00253-2

zbMATH Keywords

approximation algorithmworst-case analysis

Mathematics Subject Classification ID

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

Related Items (4)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A two-stage flow shop scheduling with a critical machine and batch availability ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine

Cites Work

• Unnamed Item
• Approximability of flow shop scheduling
• Heuristics for short route job shop scheduling problems
• On some geometric methods in scheduling theory: A survey
• Minimizing makespan in hybrid flowshops
• Two-stage flowshop scheduling with a common second-stage machine
• Optimal two- and three-stage production schedules with setup times included
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• A flowshop scheduling problem with two operations per job
• Improved Approximation Algorithms for Shop Scheduling Problems
• A New Heuristic for Three-Machine Flow Shop Scheduling
• Short Shop Schedules
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage
• Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
• The Two-Stage Assembly Scheduling Problem: Complexity and Approximation

This page was built for publication: Heuristics for the two-stage job shop scheduling problem with a bottleneck machine