Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption

DOI10.1155/2013/138240zbMATH Open1296.90062OpenAlexW2001705588WikidataQ59022860 ScholiaQ59022860MaRDI QIDQ459536FDOQ459536

Authors: Zhang Xingong, Yong Wang 

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

Recommendations

• Rescheduling problems with deteriorating jobs under disruptions
• scientific article; zbMATH DE number 7028959
• The rescheduling problem on minimizing the total lateness with time disruption and deteriorating jobs
• Minimizing total lateness with deteriorating jobs based on rescheduling problems
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimizing Total Tardiness on One Machine is NP-Hard
• Time-dependent scheduling
• Scheduling Deteriorating Jobs on a Single Processor
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• A concise survey of scheduling with time-dependent processing times
• Rescheduling for new orders on a single machine with setup times
• Rescheduling for New Orders
• Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
• Scheduling jobs under simple linear deterioration
• Production scheduling/rescheduling in flexible manufacturing
• Rescheduling problems with deteriorating jobs under disruptions
• A due-date assignment problem with learning effect and deteriorating jobs
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• Real-time scheduling of an automated manufacturing center
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs

Cited In (5)

• Rescheduling job shops under random disruptions
• Minimizing total lateness with deteriorating jobs based on rescheduling problems
• The rescheduling problem on minimizing the total lateness with time disruption and deteriorating jobs
• Rescheduling problems with deteriorating jobs under disruptions
• Rescheduling problems with allowing for the unexpected new jobs arrival

This page was built for publication: Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459536)