Rescheduling problems with allowing for the unexpected new jobs arrival
From MaRDI portal
Publication:2125233
DOI10.1007/S10878-021-00803-4zbMATH Open1490.90142OpenAlexW3198819192MaRDI QIDQ2125233FDOQ2125233
Authors: Zhang Xingong, Win-Chin Lin, Chin-Chia Wu
Publication date: 13 April 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00803-4
Recommendations
- Rescheduling problems with deteriorating jobs under disruptions
- Rescheduling for job unavailability
- Rescheduling for New Orders
- Rescheduling with new orders and general maximum allowable time disruptions
- Rescheduling for multiple new orders
- Rescheduling job shops under random disruptions
- Les problèmes d'ordonnancement
- Scheduling problems
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- The two-machine total completion time flow shop problem
- Executing production schedules in the face of uncertainties: a review and some future directions
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- Title not available (Why is that?)
- Rescheduling for new orders on a single machine with setup times
- Rescheduling for job unavailability
- Rescheduling for New Orders
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
- Rescheduling due to machine disruption to minimize the total weighted completion time
- 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
- Rescheduling with new orders and general maximum allowable time disruptions
- A dual algorithm for the one-machine scheduling problem
- A bi-objective approach to reschedule new jobs in a one machine model
- Rescheduling problems with deteriorating jobs under disruptions
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Title not available (Why is that?)
- Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients
- Rescheduling production and outbound deliveries when transportation service is disrupted
Cited In (23)
- Single machine rescheduling for new orders with maximum lateness minimization
- Rescheduling for multiple new orders
- Rescheduling problems with learning effect
- Anchored rescheduling problems under generalized precedence constraints
- Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem
- Insertion of a random task in a schedule: a real-time approach
- Predictive-reactive strategy for identical parallel machine rescheduling
- Rescheduling for New Orders
- Rescheduling production and outbound deliveries when transportation service is disrupted
- Heuristics for flow shop rescheduling with mixed blocking constraints
- Rescheduling problems with bicriteria
- Rescheduling for rush jobs on single machine with loads locked original scheduling
- Rescheduling with release time to minimize sum of waiting time considering waiting constraint of original loads
- Bi-objective missile rescheduling for a naval task group with dynamic disruptions
- Rescheduling to minimize the maximum weighted completion time
- Rescheduling under disruptions in manufacturing systems. Models and algorithms
- Rescheduling with new orders and general maximum allowable time disruptions
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
- Parallel machine match-up scheduling with manufacturing cost considerations
- Rescheduling problems with deteriorating jobs under disruptions
- Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
- Rescheduling for job unavailability
- Single-machine rescheduling of minimizing the maximum lateness with the disruptive arrival of new jobs
This page was built for publication: Rescheduling problems with allowing for the unexpected new jobs arrival
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2125233)