Pages that link to "Item:Q4399116"

The following pages link to Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times (Q4399116):

Displaying 30 items.

• Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis (Q421447) (← links)
• Scheduling algorithms for a semiconductor probing facility (Q609817) (← links)
• Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates (Q614053) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness (Q864814) (← links)
• A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness (Q869149) (← links)
• Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach (Q880526) (← links)
• Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication (Q880579) (← links)
• Coordinating decentralized local schedulers in complex supply chain manufacturing (Q940924) (← links)
• Parallel machine scheduling with precedence constraints and setup times (Q991370) (← links)
• Benchmarks for shop scheduling problems (Q1296703) (← links)
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
• A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
• Terminal inventory level constraints for online production scheduling (Q2239846) (← links)
• Aversion scheduling in the presence of risky jobs (Q2432856) (← links)
• No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
• Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs (Q2483511) (← links)
• Semiconductor final-test scheduling under setup operator constraints (Q2669721) (← links)
• A Progressive Hedging Approach for Surgery Planning Under Uncertainty (Q2802252) (← links)
• Infinite capacity planning for IC packaging plants (Q3163167) (← links)
• An adaptive scheduling algorithm for a parallel machine problem with rework processes (Q3163785) (← links)
• Adaptive scheduling and tool flow control in flexible job shops (Q3518505) (← links)
• Capacity-constrained scheduling for a logic IC final test facility (Q4474709) (← links)
• Scheduling of wafer test processes in semiconductor manufacturing (Q4474714) (← links)
• In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations (Q5428722) (← links)
• Scheduling of unrelated parallel manufacturing cells with limited human resources (Q5444619) (← links)
• A review of planning and scheduling systems and methods for integrated steel production (Q5943554) (← links)
• Minimization of maximum lateness on parallel machines with a single server and job release dates (Q6614640) (← links)