Rescheduling for job unavailability

DOI10.1287/OPRE.1090.0751MaRDI QIDQ3098270zbMATH OpenOpenAlexFDO

Authors Nicholas G. Hall, Chris N. Potts

Publication date 17 November 2011

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/091fdc141fc0d6db1f49d90352c304a15f82b033

zbMATH Keywords

deterministic schedulingmanufacturingperformanceproductivitysequencingsingle machine

Mathematics Subject Classification ID

Production models (90B30) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Rescheduling for multiple new orders
• Rescheduling for New Orders
• Rescheduling due to machine disruption to minimize the total weighted completion time
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Rescheduling to minimize the maximum weighted completion time

Cited in

(25)

• Rescheduling of identical parallel machines under machine eligibility constraints.
• Single-machine rescheduling problems with learning effect under disruptions
• Cost allocation in rescheduling with machine unavailable period
• Optimally rescheduling jobs with a last-in-first-out buffer
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Rescheduling problems with allowing for the unexpected new jobs arrival
• A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
• Rescheduling production and outbound deliveries when transportation service is disrupted
• Anchored rescheduling problems under generalized precedence constraints
• Rescheduling due to machine disruption to minimize the total weighted completion time
• Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
• Predictive-reactive strategy for identical parallel machine rescheduling
• Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
• Rescheduling for multiple new orders
• Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
• Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
• Rescheduling for New Orders
• Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs
• Rescheduling for machine disruption to minimize makespan and maximum lateness
• Rescheduling with release time to minimize sum of waiting time considering waiting constraint of original loads
• Rescheduling for rush jobs on single machine with loads locked original scheduling
• Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
• Approximation scheme for single-machine rescheduling with job delay and rejection
• Anchored rescheduling problem with non-availability periods
• Integrated production and transportation rescheduling with type-dependent setup times and multiple shipping modes

This page was built for publication: Rescheduling for job unavailability

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