Rescheduling for multiple new orders
From MaRDI portal
Recommendations
Cited in
(44)- The one machine scheduling problem: insertion of a job under the real-time constraint
- One-machine rescheduling heuristics with efficiency and stability as criteria
- Rescheduling on a single machine with part-type dependent setup times and deadlines
- Rescheduling of identical parallel machines under machine eligibility constraints.
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling
- Cost allocation in rescheduling with machine unavailable period
- Rescheduling for new orders on a single machine with setup times
- Exact lexicographic scheduling and approximate rescheduling
- Optimally rescheduling jobs with a last-in-first-out buffer
- Rescheduling problems with allowing for the unexpected new jobs arrival
- Single machine rescheduling for new orders with maximum lateness minimization
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling
- Rescheduling production and outbound deliveries when transportation service is disrupted
- Anchored rescheduling problems under generalized precedence constraints
- Single machine scheduling to minimize maximum lateness subject to release dates and precedence constraints
- Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain
- Rescheduling due to machine disruption to minimize the total weighted completion time
- Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- Reoptimization in machine scheduling
- Predictive-reactive strategy for identical parallel machine rescheduling
- Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption
- Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem
- Rescheduling for two agents under a limit on the lateness of the original jobs
- Pareto optimizations for rescheduling problems
- Rescheduling for job unavailability
- Rescheduling to minimize the maximum weighted completion time
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time
- Rescheduling with new orders and general maximum allowable time disruptions
- Improving schedule stability in single-machine rescheduling for new operation insertion
- Rescheduling problems with bicriteria
- Rescheduling for New Orders
- A new rescheduling method for computer based scheduling systems
- Rescheduling to minimize the maximum lateness under the sequence disruptions of original jobs
- Analysis and experimental study of heuristics for job scheduling reoptimization problems
- Rescheduling for machine disruption to minimize makespan and maximum lateness
- Reoptimization of the minimum total flow-time scheduling problem
- Rescheduling with release time to minimize sum of waiting time considering waiting constraint of original loads
- A bi-objective approach to reschedule new jobs in a one machine model
- 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
- Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
- Applying local rescheduling in response to schedule disruptions
- Single machine rescheduling for new orders with maximum and total time disruption constraints
This page was built for publication: Rescheduling for multiple new orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892374)
