Flow shops with reentry: the total weighted completion time objective
From MaRDI portal
Cites work
- `` Strong NP-Completeness Results
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- Algorithms for Scheduling Independent Tasks
- An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
- Complexity results for single-machine problems with positive finish-start time-lags
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
- Flow shops with reentry: reversibility properties and makespan optimal schedules
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Job scheduling of diffusion furnaces in semiconductor fabrication facilities
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Minimizing Makespan in a Class of Reentrant Shops
- Minimizing makespan in re-entrant permutation flow-shops
- Minimizing makespan on a two-machine re-entrant flowshop
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Minimizing total completion time for re-entrant flow shop scheduling problems
- On scheduling cycle shops: Classification, complexity and approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Reducibility among combinatorial problems
- Scheduling. Theory, algorithms, and systems
- Semiconductor manufacturing scheduling and dispatching
- V-shop scheduling
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
This page was built for publication: Flow shops with reentry: the total weighted completion time objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883935)
