Pages that link to "Item:Q4394265"

The following pages link to Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265):

Displaying 40 items.

• Parameter-free sampled fictitious play for solving deterministic dynamic programming problems (Q289136) (← links)
• An efficient two-stage algorithm for decentralized scheduling of micro-CHP units (Q319702) (← links)
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan (Q342431) (← links)
• Performance analysis of assembly systems with unreliable machines and finite buffers (Q706982) (← links)
• An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production (Q709140) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops (Q857354) (← links)
• A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families (Q878578) (← links)
• A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
• Scheduling of multi-spindle CNC gantry mills (Q1347599) (← links)
• Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
• Decomposition methods for large job shops (Q1592580) (← links)
• Using real time information for effective dynamic scheduling (Q1604065) (← links)
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
• Imaging-duration embedded dynamic scheduling of Earth observation satellites for emergent events (Q1666457) (← links)
• A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
• Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem (Q1781577) (← links)
• Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
• Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
• A survey of dynamic scheduling in manufacturing systems (Q2268515) (← links)
• Scheduling of tasks with effectiveness precedence constraints (Q2300636) (← links)
• A rolling window optimization method for large-scale WCDMA base stations planning problem (Q2370359) (← links)
• Aversion scheduling in the presence of risky jobs (Q2432856) (← links)
• A linear programming-based method for job shop scheduling (Q2434310) (← links)
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
• Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches (Q2485332) (← links)
• A bicriteria scheduling with sequence-dependent setup times (Q2506355) (← links)
• Semiconductor final-test scheduling under setup operator constraints (Q2669721) (← links)
• A Progressive Hedging Approach for Surgery Planning Under Uncertainty (Q2802252) (← links)
• Adaptive scheduling and tool flow control in flexible job shops (Q3518505) (← links)
• (Q4238569) (← links)
• Scheduling batch processing machines with incompatible job families (Q4399080) (← links)
• Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times (Q4399116) (← links)
• Capacity-constrained scheduling for a logic IC final test facility (Q4474709) (← links)
• In-house development of scheduling decision support systems: case study for scheduling semiconductor device test operations (Q5428722) (← links)
• Analysis of reactive scheduling problems in a job shop environment (Q5928448) (← links)
• A review of planning and scheduling systems and methods for integrated steel production (Q5943554) (← links)
• A two‐step optimization model for the distribution of perishable products (Q6087144) (← links)
• Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates (Q6554640) (← links)
• Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)