Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption
From MaRDI portal
Publication:459536
DOI10.1155/2013/138240zbMath1296.90062OpenAlexW2001705588WikidataQ59022860 ScholiaQ59022860MaRDI QIDQ459536
Publication date: 13 October 2014
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/138240
Cites Work
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
- Single-machine scheduling against due dates with past-sequence-dependent setup times
- Time-dependent scheduling
- Rescheduling problems with deteriorating jobs under disruptions
- A due-date assignment problem with learning effect and deteriorating jobs
- Real-time scheduling of an automated manufacturing center
- Scheduling jobs under simple linear deterioration
- A concise survey of scheduling with time-dependent processing times
- Rescheduling for new orders on a single machine with setup times
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Deteriorating Jobs on a Single Processor
- Rescheduling for New Orders
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Production scheduling/rescheduling in flexible manufacturing
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
This page was built for publication: Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption
