Pages that link to "Item:Q4661099"

The following pages link to Makespan minimization in single-machine scheduling with step-deterioration of processing times (Q4661099):

Displaying 13 items.

• Modeling the parallel machine scheduling problem with step deteriorating jobs (Q323474) (← links)
• A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
• Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times (Q968039) (← links)
• A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
• Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
• Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (Q2471235) (← links)
• Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
• Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)