A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones

DOI10.1002/nav.22154OpenAlexW4387703218MaRDI QIDQ6130706

No author found.

Publication date: 3 April 2024

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.22154

zbMATH Keywords

schedulingbranch-and-priceidentical parallel machineprogress milestones

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multitasking via alternate and shared processing: algorithms and complexity
• Strong LP formulations for scheduling splittable jobs on unrelated machines
• Multitasking scheduling problems with deterioration effect
• Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
• Interval scheduling with economies of scale
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
• Solving Parallel Machine Scheduling Problems by Column Generation
• An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
• Scheduling Jobs on Several Machines with the Job Splitting Property
• Multitasking scheduling with multiple rate‐modifying activities

This page was built for publication: A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones