Pages that link to "Item:Q1374439"

The following pages link to Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time (Q1374439):

Displaying 22 items.

• An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times (Q418297) (← links)
• An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← links)
• A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs (Q1266534) (← links)
• A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835) (← links)
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (Q1273118) (← links)
• Dynamic scheduling of aircraft landings (Q1698918) (← links)
• Heuristic methods for the identical parallel machine flowtime problem with set-up times (Q1772875) (← links)
• Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← links)
• Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
• Optimization of setup times in the furniture industry (Q1945078) (← links)
• Scheduling with batching: A review (Q1969826) (← links)
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times (Q1976518) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• Approximation algorithms for problems in scheduling with set-ups (Q2476258) (← links)
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
• Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
• (Q3435071) (← links)
• Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption (Q4909020) (← links)