Open shop scheduling with machine dependent processing times

DOI10.1016/0166-218X(92)90176-BzbMath0767.90035MaRDI QIDQ1201806

Moshe Dror

Publication date: 17 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

makespanNP-hardmean flow timemachine dependent processing times

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

The two-machine no-wait general and proportionate open shop makespan problem ⋮ An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Two machine openshop scheduling with machine-dependent processing times ⋮ Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling

Cites Work

• Unnamed Item
• Openshop and flowshop scheduling to minimize sum of completion times
• Open-shop scheduling problems with dominated machines
• Scheduling the Open Shop to Minimize Mean Flow Time
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Open shop scheduling with machine dependent processing times