Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
From MaRDI portal
Publication:1930748
DOI10.1016/j.apm.2011.12.010zbMath1254.90066OpenAlexW2020707914MaRDI QIDQ1930748
Maedeh Bank, J. Behnamian, Seyyed Mohammad Taghi Fatemi Ghomi, Fariborz Jolai
Publication date: 13 January 2013
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.12.010
Related Items
Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Single machine problem with multi-rate-modifying activities under a time-dependent deterioration ⋮ A two-machine flowshop scheduling problem with precedence constraint on two jobs ⋮ Single-machine scheduling with accelerating deterioration effects ⋮ Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems ⋮ Permutation Flow Shop Problem with Shortening Job Processing Times
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Single-machine total completion time scheduling with a time-dependent deterioration
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- Single-machine due-window assignment problem with learning effect and deteriorating jobs
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- A concise survey of scheduling with time-dependent processing times
- Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Scheduling with time dependent processing times: Review and extensions
- SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING
- The Complexity of Flowshop and Jobshop Scheduling
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- Flow shop scheduling problems with deteriorating jobs under dominating machines
- Multi-Machine Scheduling With Linear Deterioration
- Minimizing tardiness in a two-machine flow-shop
