Two-machine shop scheduling: Compromise between flexibility and makespan value

DOI10.1016/j.ejor.2004.01.029zbMath1154.90446OpenAlexW1973788172MaRDI QIDQ2566711

Vitaly A. Strusevich, Jean-Charles Billaut, Carl Esswein

Publication date: 28 September 2005

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.01.029

zbMATH Keywords

SchedulingOpen shopRobustnessFlow shopFlexibilityJob shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (8)

AN IMPROVED APPROXIMATION ALGORITHM FOR THE TWO-MACHINE FLOW SHOP SCHEDULING PROBLEM WITH AN INTERSTAGE TRANSPORTER ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ On the optimality conditions of the two-machine flow shop problem ⋮ Unnamed Item ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• A new fully polynomial time approximation scheme for the Knapsack problem
• Project scheduling under uncertainty: survey and research potentials
• Scheduling with batching: A review
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• Optimal two- and three-stage production schedules with setup times included
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A new method for workshop real time scheduling

This page was built for publication: Two-machine shop scheduling: Compromise between flexibility and makespan value