Two-machine shop scheduling with zero and unit processing times
From MaRDI portal
Publication:1296097
Recommendations
- scientific article; zbMATH DE number 930117
- scientific article; zbMATH DE number 2109433
- Two-machine flow-shop scheduling with equal processing time on the second machine for minimizing total weighted completion time
- Open shop problem with zero-one time operations and integer release date/deadline intervals
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
Cites work
- scientific article; zbMATH DE number 4128645 (Why is no real title available?)
- scientific article; zbMATH DE number 724323 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- scientific article; zbMATH DE number 3433334 (Why is no real title available?)
- Open shop problems with unit time operations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling independent tasks to reduce mean finishing time
- Scheduling the Open Shop to Minimize Mean Flow Time
- Some no-wait shops scheduling problems: Complexity aspect
- The Complexity of Flowshop and Jobshop Scheduling
- Unit Execution Time Shop Problems
Cited in
(3)
This page was built for publication: Two-machine shop scheduling with zero and unit processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296097)