Scheduling ordered open shops

DOI10.1016/0305-0548(87)90029-3zbMATH Open0625.90045OpenAlexW2040889502MaRDI QIDQ580167FDOQ580167

Robert L. Bulfin, C. Y. Liu

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

makespanNP-completeopen shop

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Open Shop Scheduling to Minimize Finish Time
• Open-shop scheduling problems with dominated machines
• Unit Execution Time Shop Problems
• Scheduling the Open Shop to Minimize Mean Flow Time
• 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
• A Note on Open Shop Preemptive Schedules
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• An Algorithm for the Open-Shop Problem

Cited In (23)

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

This page was built for publication: Scheduling ordered open shops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580167)