Flow shops with WIP and value added costs
From MaRDI portal
Publication:969753
DOI10.1007/s10951-009-0130-zzbMath1185.90102OpenAlexW1991781489MaRDI QIDQ969753
Publication date: 7 May 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0130-z
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Openshop and flowshop scheduling to minimize sum of completion times
- Flowshop sequencing with mean flowtime objective
- The two-machine total completion time flow shop problem
- The complexity of scheduling jobs in repetitive manufacturing systems
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- A new heuristic for the n-job, M-machine flow-shop problem
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- Minimizing the total flow time and the tardiness in a two-machine flow shop
- Some new results in flow shop scheduling
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
