Open shops with jobs overlap
From MaRDI portal
Publication:1319530
DOI10.1016/0377-2217(93)90347-PzbMath0797.90047MaRDI QIDQ1319530
Edouard Wagneur, Chelliah Skriskandarajah
Publication date: 25 October 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
open shop; heuristic; parallel processing; maximum completion time; polynomial time algorithms; total tardiness; maximum tardiness; sum of completion times; permutation schedules; overlapping of jobs
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
Order Scheduling Models: Hardness and Algorithms, Minimizing the sum of weighted completion times in a concurrent open shop, Open shops with jobs overlap -- revisited, Order scheduling in an environment with dedicated resources in parallel, A note on the complexity of the concurrent open shop problem, Scheduling orders for multiple product types to minimize total weighted completion time, Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps, On the complexity of preemptive openshop scheduling problems, Customer order scheduling to minimize the number of late jobs, Preemptive multiprocessor order scheduling to minimize total weighted flowtime, Scheduling orders for multiple product types with due date related objectives, Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time, Scheduling with centralized and decentralized batching policies in concurrent open shops
Cites Work
- Global analysis and economics. III: Pareto Optima and price equilibria
- On the complexity of preemptive openshop scheduling problems
- A Note On The Complexity Of Openshop Scheduling Problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
