Proportionate flow shop: New complexity results and models with due date assignment
From MaRDI portal
Publication:5249462
DOI10.1002/nav.21615zbMath1310.90048OpenAlexW1941004152MaRDI QIDQ5249462
Christos P. Koulamas, Shrikant S. Panwalkar
Publication date: 6 May 2015
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21615
Related Items
Proportionate flowshop scheduling with position-dependent weights ⋮ Regular scheduling measures on proportionate flowshop with job rejection ⋮ Proportionate Flow Shop Scheduling with Two Competing Agents to Minimize Weighted Late Work and Weighted Number of Late Jobs ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- A survey on offline scheduling with rejection
- Scheduling ordered open shops
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Two due date assignment problems in scheduling a single machine
- A faster algorithm for a due date assignment problem with tardy jobs
- Minimizing total weighted completion time in a proportionate flow shop
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Flow shop and open shop scheduling with a critical machine and two operations per job
- The three-machine proportionate flow shop problem with unequal machine speeds
- Comments on Flow shop and open shop scheduling with a critical machine and two operations per job
- Common due window size and location determination in a single machine scheduling problem
- Principles of Sequencing and Scheduling
- Focused Scheduling in Proportionate Flowshops
- On J -maximal and J -minimal Flow-Shop Schedules
- Counterexamples to optimal permutation schedules for certain flow shop problems
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Minimizing the Expected Makespan in Stochastic Flow Shops
- Flowshop Sequencing Problem with Ordered Processing Time Matrices
- Flowshop and Jobshop Schedules: Complexity and Approximation
- A note on the influence of missing operations on scheduling problems
