A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

DOI10.1016/J.EJOR.2004.03.022MaRDI QIDQ2485328zbMATH OpenOpenAlexFDO

Authors Simon Dunstall, Andrew Wirth

Publication date 4 August 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2004.03.022

zbMATH Keywords

SchedulingBranch and boundParallel machinesSetup times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Exact algorithms for scheduling multiple families of jobs on parallel machines
• Scheduling identical parallel machines to minimize total weighted completion time
• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

Cites work

• scientific article; zbMATH DE number 3632203 (Why is no real title available?)
• scientific article; zbMATH DE number 10435 (Why is no real title available?)
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• Algorithms for Scheduling Independent Tasks
• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
• Batch scheduling to minimize total completion time
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
• Dynamic programming algorithms for scheduling parallel machines with family setup times
• List scheduling revisited
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
• Note on ``Parallel machine scheduling with batch setup times
• On the Complexity of Scheduling with Batch Setup Times
• On the minimization of total weighted flow time with identical and uniform parallel machines
• Parallel Machine Scheduling with Batch Setup Times
• Scheduling identical parallel machines to minimize total weighted completion time
• Scheduling independent tasks to reduce mean finishing time
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Scheduling with batching: A review
• Solving Parallel Machine Scheduling Problems by Column Generation
• Technical Note—Minimizing Average Flow Time with Parallel Machines
• The complexity of scheduling job families about a common due date
• Weighted flow time bounds for scheduling identical processors

Cited in

(16)

• Parallel machine scheduling with preference of machines
• Petri net scheduling of parallel manufacturing systems based on a new branch and bound algorithm
• A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
• Parallel machines scheduling with machine preference via agent-based approach
• Scheduling about a common due date with earliness and tardiness penalties
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
• An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
• Two branch-and-bound algorithms for the robust parallel machine scheduling problem
• Iterated greedy algorithms for a complex parallel machine scheduling problem
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
• A survey of scheduling problems with setup times or costs
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Search tree based approaches for parallel machine scheduling
• Heuristic methods for the identical parallel machine flowtime problem with set-up times

This page was built for publication: A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485328)