Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
From MaRDI portal
Publication:322965
DOI10.1016/J.EJOR.2016.01.045zbMATH Open1346.90399OpenAlexW2289974319MaRDI QIDQ322965FDOQ322965
Authors: Yunqiang Yin, Du-Juan Wang, T. C. Edwin Cheng 
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.045
Recommendations
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- Rescheduling due to machine disruption to minimize the total weighted completion time
- Rescheduling to minimize total completion time under a limit time disruption for the parallel batch
- Parallel-machine scheduling under potential disruption
- Minimization of the weighted number of tardy jobs of two parallel machines scheduling with machine disruptions
combinatorial optimizationproductionbicriterion analysisreschedulingtwo-dimensional fully polynomial-time approximation scheme
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Single machine flow-time scheduling with a single breakdown
- 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
- Modelling generator maintenance scheduling costs in deregulated power markets
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- Rescheduling for new orders on a single machine with setup times
- Rescheduling for multiple new orders
- Rescheduling for job unavailability
- Dispatching strategies for managing uncertainties in automated manufacturing systems
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance
- Scheduling a maintenance activity on parallel identical machines
- Rescheduling for New Orders
- Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
Cited In (27)
- Minimization of the weighted number of tardy jobs of two parallel machines scheduling with machine disruptions
- Rescheduling due to machine disruption to minimize the total weighted completion time
- Enhancing stability and robustness in online machine shop scheduling: a multi-agent system and negotiation-based approach for handling machine downtime in industry 4.0
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability
- Parallel-machine scheduling with potential disruption and positional-dependent processing times
- An ILS heuristic for the ship scheduling problem: application in the oil industry
- Generating all efficient solutions of a rescheduling problem on unrelated parallel machines
- Identical parallel machine rescheduling under complex restrictions
- Predictive-reactive strategy for identical parallel machine rescheduling
- Rescheduling production and outbound deliveries when transportation service is disrupted
- Approximation scheme for single-machine rescheduling with job delay and rejection
- Risk measure of job shop scheduling with random machine breakdowns
- Disruption management for single machine scheduling on total loss before completion
- Two machine scheduling under disruptions with transportation considerations
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Parallel-machine scheduling under potential disruption
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- The rescheduling problem on minimizing the total lateness with time disruption and deteriorating jobs
- Optimizing makespan and stability risks in job shop scheduling
- Scheduling wagons to unload in bulk cargo ports with uncertain processing times
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
- Minimizing maximum tardiness on a single machine with family setup times and machine disruption
- A dispatching algorithm for parallel machines with rework processes
- Rescheduling to minimize total completion time under a limit time disruption for the parallel batch
- Manufacturing rescheduling after crisis or disaster-caused supply chain disruption
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection
This page was built for publication: Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322965)
