Improving schedule stability in single-machine rescheduling for new operation insertion

DOI10.1016/j.cor.2015.05.015zbMath1349.90304OpenAlexW1603269722MaRDI QIDQ342084

Can Akkan

Publication date: 17 November 2016

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

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

zbMATH Keywords

stabilityheuristicsrobustnessproduction schedulingsingle machinedeterministic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Rescheduling with new orders and general maximum allowable time disruptions, Predictive-reactive strategy for identical parallel machine rescheduling

Cites Work

• Unnamed Item
• A robust approach for the single machine scheduling problem
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• The one-machine sequencing problem
• One-machine rescheduling heuristics with efficiency and stability as criteria
• Executing production schedules in the face of uncertainties: a review and some future directions
• A survey of dynamic scheduling in manufacturing systems
• Rescheduling manufacturing systems: A framework of strategies, policies, and methods
• A recovering beam search algorithm for the single machine just-in-time scheduling problem
• Multicriteria scheduling
• Rescheduling for Multiple New Orders
• Rescheduling for New Orders
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
• Predictable scheduling of a single machine with breakdowns and sensitive jobs
• Single-machine scheduling with early and tardy completion costs