The following pages link to Rescheduling for New Orders (Q3637438):
Displaying 50 items.
- Rescheduling on identical parallel machines with machine disruptions to minimize total completion time (Q322965) (← links)
- Rescheduling with new orders and general maximum allowable time disruptions (Q330107) (← links)
- Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance (Q337088) (← links)
- Improving schedule stability in single-machine rescheduling for new operation insertion (Q342084) (← links)
- Rescheduling problems with agreeable job parameters to minimize the tardiness costs under deterioration and disruption (Q459536) (← links)
- Rescheduling for machine disruption to minimize makespan and maximum lateness (Q490326) (← links)
- Applying local rescheduling in response to schedule disruptions (Q613784) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- A fuzzy logic based production scheduling/rescheduling in the presence of uncertain disruptions (Q853448) (← links)
- Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption (Q881562) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Rescheduling problems with deteriorating jobs under disruptions (Q967797) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Analysis of reactive deadlock-free scheduling in flexible job shops (Q1028658) (← links)
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs (Q1640602) (← links)
- A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling (Q1652172) (← links)
- Single-machine rescheduling problems with learning effect under disruptions (Q1717008) (← links)
- Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
- Rescheduling for new orders on a single machine with setup times (Q1926981) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Rescheduling problems with allowing for the unexpected new jobs arrival (Q2125233) (← links)
- Single machine rescheduling for new orders with maximum lateness minimization (Q2147102) (← links)
- A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling (Q2168763) (← links)
- Rescheduling production and outbound deliveries when transportation service is disrupted (Q2184098) (← links)
- Scheduling two projects with controllable processing times in a single-machine environment (Q2215194) (← links)
- Two-agent single-machine scheduling problem with just-in-time jobs (Q2250441) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain (Q2295058) (← links)
- Rescheduling due to machine disruption to minimize the total weighted completion time (Q2317133) (← links)
- Partitioning sequencing situations and games (Q2378467) (← links)
- Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization (Q2402113) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption (Q2434315) (← links)
- The complexity of machine scheduling for stability with a single disrupted job (Q2488217) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Predictive-reactive strategy for identical parallel machine rescheduling (Q2669491) (← links)
- Single-machine rescheduling with deterioration and learning effects against the maximum sequence disruption (Q2792200) (← links)
- Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem (Q2840760) (← links)
- Rescheduling for multiple new orders (Q2892374) (← links)
- A generic deadlock-free reactive scheduling approach (Q3055283) (← links)
- Rescheduling for Job Unavailability (Q3098270) (← links)
- RESCHEDULING WITH RELEASE DATES TO MINIMIZE TOTAL SEQUENCE DISRUPTION UNDER A LIMIT ON THE MAKESPAN (Q3502863) (← links)
- Economic scheduling of a new order in a job-shop production system (Q4286569) (← links)
- Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs (Q4595325) (← links)
- Bi‐objective missile rescheduling for a naval task group with dynamic disruptions (Q5241425) (← links)
- A bi‐objective approach to reschedule new jobs in a one machine model (Q5246808) (← links)
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures (Q5359060) (← links)
- Inventory optimization for perishables subject to supply disruptions (Q5963693) (← links)
- Manufacturing rescheduling after crisis or disaster-caused supply chain disruption (Q6106575) (← links)
