Single machine rescheduling for new orders with maximum lateness minimization

DOI10.1016/j.cor.2022.105815OpenAlexW4200630029WikidataQ114193077 ScholiaQ114193077MaRDI QIDQ2147102

Vincent T'kindt, Fabio Salassa, Elena Rener

Publication date: 22 June 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105815

zbMATH Keywords

maximum latenessbranch \& memorizesingle machine reschedulingtotal disruption

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

Cites Work

• Unnamed Item
• Rescheduling with new orders and general maximum allowable time disruptions
• Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
• Rescheduling problems with deteriorating jobs under disruptions
• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Rescheduling for new orders on a single machine with setup times
• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
• Rescheduling for Multiple New Orders
• RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN
• Rescheduling for New Orders
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A bi‐objective approach to reschedule new jobs in a one machine model

This page was built for publication: Single machine rescheduling for new orders with maximum lateness minimization