Pages that link to "Item:Q1273118"

The following pages link to Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time (Q1273118):

Displaying 18 items.

• An online algorithm for a problem in scheduling with set-ups and release times (Q534771) (← 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 batch set-up times to minimize total weighted completion time (Q1374439) (← links)
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness (Q1683059) (← links)
• A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
• Two-machine flowshop scheduling with job class setups to minimize total flowtime (Q1781550) (← 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)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs (Q2370330) (← links)
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs (Q2464440) (← 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)
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
• Minimizing flow time on a single machine with job classes and setup times (Q4713573) (← links)
• Minimizing sum of completion times on a single machine with sequence-dependent family setup times (Q5469663) (← links)