Rescheduling problems with allowing for the unexpected new jobs arrival
From MaRDI portal
Publication:2125233
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
- A bi-objective approach to reschedule new jobs in a one machine model
- A dual algorithm for the one-machine scheduling problem
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Executing production schedules in the face of uncertainties: a review and some future directions
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 7028959 (Why is no real title available?)
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization by simulated annealing
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- Rescheduling due to machine disruption to minimize the total weighted completion time
- Rescheduling for job unavailability
- Rescheduling for New Orders
- Rescheduling for new orders on a single machine with setup times
- Rescheduling manufacturing systems: A framework of strategies, policies, and methods
- Rescheduling problems with deteriorating jobs under disruptions
- Rescheduling production and outbound deliveries when transportation service is disrupted
- Rescheduling with new orders and general maximum allowable time disruptions
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption
- Scheduling and rescheduling elective patients in operating rooms to minimise the percentage of tardy patients
- Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
- The two-machine total completion time flow shop problem
Cited in
(27)- Rescheduling on a single machine with part-type dependent setup times and deadlines
- Single machine rescheduling for new orders with maximum lateness minimization
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
- Rescheduling under disruptions in manufacturing systems. Models and algorithms
- Rescheduling production and outbound deliveries when transportation service is disrupted
- Anchored rescheduling problems under generalized precedence constraints
- Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
- Predictive-reactive strategy for identical parallel machine rescheduling
- Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem
- Rescheduling for multiple new orders
- Rescheduling for job unavailability
- Rescheduling to minimize the maximum weighted completion time
- Rescheduling with new orders and general maximum allowable time disruptions
- Rescheduling problems with bicriteria
- Rescheduling for New Orders
- Rescheduling problems with learning effect
- 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
- Single-machine rescheduling of minimizing the maximum lateness with the disruptive arrival of new jobs
- Rescheduling for rush jobs on single machine with loads locked original scheduling
- Heuristics for flow shop rescheduling with mixed blocking constraints
- Single machine rescheduling for new orders with maximum and total time disruption constraints
- No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
- Insertion of a random task in a schedule: a real-time approach
- Integrated production and transportation rescheduling with type-dependent setup times and multiple shipping modes
- Rescheduling problems with deteriorating jobs under disruptions
- Parallel machine match-up scheduling with manufacturing cost considerations
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)
