Dantzig-Wolfe Decomposition for Job Shop Scheduling

DOI10.1007/0-387-25486-2_10MaRDI QIDQ5493635zbMATH OpenOpenAlexFDO

Authors Sylvie Gélinas, François Soumis

Publication date 16 October 2006

Published in Column Generation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-25486-2_10

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Solving Parallel Machine Scheduling Problems by Column Generation
• A linear programming-based method for job shop scheduling
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
• Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach

Cited in

(5)

• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Dantzig-Wolfe decomposition for the facility location and production planning problem
• Branch-and-price approach for the multi-skill project scheduling problem
• An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
• The job shop scheduling problem with convex costs

This page was built for publication: Dantzig-Wolfe Decomposition for Job Shop Scheduling

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