Rescheduling on a single machine with part-type dependent setup times and deadlines

DOI10.1023/A:1018955111939zbMath0889.90092OpenAlexW109241435MaRDI QIDQ1374422

Ali S. Kiran, Reha Uzsoy, Ali Tamer Ünal

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018955111939

zbMATH Keywords

heuristicssingle machinepolynomial-time algorithmdue datestotal weighted completion timerescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (25)

Executing production schedules in the face of uncertainties: a review and some future directions ⋮ Partitioning sequencing situations and games ⋮ 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 ⋮ Coping with production time variability via dynamic lead-time quotation ⋮ Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance ⋮ A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling ⋮ A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling ⋮ Two machine scheduling under disruptions with transportation considerations ⋮ Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption ⋮ Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Rescheduling for new orders on a single machine with setup times ⋮ RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN ⋮ Rescheduling of identical parallel machines under machine eligibility constraints. ⋮ 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 ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Rescheduling problems with deteriorating jobs under disruptions ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ A generic deadlock-free reactive scheduling approach ⋮ Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption ⋮ Reallocation problems in scheduling ⋮ Analysis of reactive deadlock-free scheduling in flexible job shops

This page was built for publication: Rescheduling on a single machine with part-type dependent setup times and deadlines