Scheduling ordered open shops

DOI10.1016/0305-0548(87)90029-3zbMath0625.90045OpenAlexW2040889502MaRDI QIDQ580167

C. Y. Liu, Robert L. Bulfin

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90029-3

zbMATH Keywords

makespanopen shopNP-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (21)

On the complexity of preemptive openshop scheduling problems ⋮ Scheduling two-machine preemptive open shops to minimize total completion time ⋮ The two-machine no-wait general and proportionate open shop makespan problem ⋮ Some positive news on the proportionate open shop problem ⋮ Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ Open shop scheduling with maximal machines ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ On the open-shop problem with preemption and minimizing the average completion time ⋮ Scheduling preemptive open shops to minimize total tardiness ⋮ Two-machine open shop scheduling with secondary criteria ⋮ A multi-level genetic algorithm for a multi-stage space allocation problem ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Proportionate flow shop: New complexity results and models with due date assignment ⋮ Flow shop and open shop scheduling with a critical machine and two operations per job

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On the complexity of preemptive open-shop scheduling problems
• Openshop and flowshop scheduling to minimize sum of completion times
• Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
• Open-shop scheduling problems with dominated machines
• A Note on Open Shop Preemptive Schedules
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling the Open Shop to Minimize Mean Flow Time
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Unit Execution Time Shop Problems
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An Algorithm for the Open-Shop Problem

This page was built for publication: Scheduling ordered open shops