Dense open-shop schedules with release times
From MaRDI portal
Publication:955015
DOI10.1016/j.tcs.2008.07.030zbMath1152.68011OpenAlexW2037453195MaRDI QIDQ955015
Wanzhen Huang, Guochun Tang, Rongjun Chen
Publication date: 18 November 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.07.030
Related Items
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Flexible open shop scheduling problem to minimize makespan, A novel complex network based dynamic rule selection approach for open shop scheduling problem with release dates, Four decades of research on the open-shop scheduling problem to minimize the makespan, Multi-objective open shop scheduling by considering human error and preventive maintenance, Polynomial time approximation algorithms for proportionate open‐shop scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Open Shop Scheduling to Minimize Finish Time
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Short Shop Schedules