Single machine rescheduling for new orders with maximum lateness minimization

DOI10.1016/J.COR.2022.105815MaRDI QIDQ2147102zbMATH OpenOpenAlexWikidataFDO

Authors Elena Rener, Fabio Salassa, Vincent T'kindt

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)

Recommendations

• Single-machine rescheduling of minimizing the maximum lateness with the disruptive arrival of new jobs
• Rescheduling for new orders on a single machine with setup times
• Single-machine scheduling to stochastically minimize maximum lateness
• Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
• Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
• scientific article; zbMATH DE number 825147
• Single-machine rescheduling with outsourcing allowed and a limit to maximum time deviation
• Scheduling on parallel machines to minimise maximum lateness for the customer order problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A bi-objective approach to reschedule new jobs in a one machine model
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN
• Rescheduling for New Orders
• Rescheduling for multiple new orders
• Rescheduling for new orders on a single machine with setup times
• Rescheduling on a single machine with part-type dependent setup times and deadlines
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Rescheduling problems with deteriorating jobs under disruptions
• 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
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
• \textit{Branch} \& \textit{memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees

Cited in

(5)

• Single-machine rescheduling of minimizing the maximum lateness with the disruptive arrival of new jobs
• Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
• Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem
• Rescheduling for multiple new orders
• Improving schedule stability in single-machine rescheduling for new operation insertion

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

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