Rescheduling on a single machine with part-type dependent setup times and deadlines
From MaRDI portal
Publication:1374422
DOI10.1023/A:1018955111939zbMATH Open0889.90092OpenAlexW109241435MaRDI QIDQ1374422FDOQ1374422
Authors: Reha Uzsoy, Ali S. Kiran, 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
Recommendations
- Rescheduling for multiple new orders
- Rescheduling for new orders on a single machine with setup times
- Rescheduling to minimize the maximum weighted completion time
- Rescheduling due to machine disruption to minimize the total weighted completion time
- Rescheduling problems with allowing for the unexpected new jobs arrival
heuristicsdue datessingle machinepolynomial-time algorithmtotal weighted completion timerescheduling
Cited In (25)
- A generic deadlock-free reactive scheduling approach
- Single machine rescheduling for new orders with maximum lateness minimization
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- Predictive-reactive strategy for identical parallel machine rescheduling
- RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN
- Cost allocation in rescheduling with machine unavailable period
- Two machine scheduling under disruptions with transportation considerations
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling
- Rescheduling of identical parallel machines under machine eligibility constraints.
- 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 machine disruption to minimize makespan and maximum lateness
- Analysis of reactive deadlock-free scheduling in flexible job shops
- Rescheduling with new orders and general maximum allowable time disruptions
- Coping with production time variability via dynamic lead-time quotation
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
- Executing production schedules in the face of uncertainties: a review and some future directions
- Rescheduling problems with deteriorating jobs under disruptions
- Rescheduling for new orders on a single machine with setup times
- Partitioning sequencing situations and games
- Reallocation problems in scheduling
This page was built for publication: Rescheduling on a single machine with part-type dependent setup times and deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374422)
