Rescheduling for Multiple New Orders

DOI10.1287/ijoc.1060.0209zbMath1241.90048OpenAlexW2065381746MaRDI QIDQ2892374

Zhixin Liu, Chris N. Potts, Nicholas G. Hall

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1060.0209

zbMATH Keywords

branch and bound algorithmdeterministic schedulingdisruptionsheuristic worst-case analysisrescheduling for new job

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (21)

Single machine rescheduling for new orders with maximum lateness minimization ⋮ Rescheduling on identical parallel machines with machine disruptions to minimize total completion time ⋮ Rescheduling with new orders and general maximum allowable time disruptions ⋮ A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling ⋮ Improving schedule stability in single-machine rescheduling for new operation insertion ⋮ A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling ⋮ Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Rescheduling for new orders on a single machine with setup times ⋮ Rescheduling production and outbound deliveries when transportation service is disrupted ⋮ Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs ⋮ Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs ⋮ Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption ⋮ Rescheduling for machine disruption to minimize makespan and maximum lateness ⋮ Cost allocation in rescheduling with machine unavailable period ⋮ Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints ⋮ Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption ⋮ Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain ⋮ Optimally rescheduling jobs with a last-in-first-out buffer ⋮ Rescheduling due to machine disruption to minimize the total weighted completion time ⋮ Applying Variable Neighborhood Search to the Single-machine Maximum Lateness Rescheduling Problem

This page was built for publication: Rescheduling for Multiple New Orders