Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound

DOI10.1016/j.cor.2008.08.013zbMath1179.90119OpenAlexW1991210775MaRDI QIDQ1010284

Adrien Vergnaud, Louis-Martin Rousseau, Michel Gendreau, Christian Artigues

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.08.013

zbMATH Keywords

constraint programmingjob-shop schedulinghybrid methodsemployee schedulingintegrated decision problem

Mathematics Subject Classification ID

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

Related Items

Constraint programming and operations research, Integrating employee timetabling with scheduling of machines and transporters in a job-shop environment: a mathematical formulation and an anarchic society optimization algorithm, Optimization of the integrated problem of employee timetabling and job shop scheduling, A project scheduling problem with periodically aggregated resource-constraints, A job-shop scheduling approach for optimising sugarcane rail operations, A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals, A cutting plane approach for integrated planning and scheduling, A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions, A new mathematical formulation for a potash-mine shift scheduling problem with a simultaneous assignment of machines and workers, Solving an integrated job-shop problem with human resource constraints, A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems, A classification scheme for integrated staff rostering and scheduling problems, A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability

Cites Work

• Simultaneous job scheduling and resource allocation on parallel machines
• A hybrid method for the planning and scheduling
• The job shop scheduling problem: Conventional and new solution techniques
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Staff scheduling and rostering: a review of applications, methods and models.
• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• Introducing global constraints in CHIP
• Linear relaxations and reduced-Cost based propagation of continuous variable subscripts
• Models and algorithms for integration of vehicle and crew scheduling
• Flow Shop Scheduling with Partial Resource Flexibility
• Revisiting the Sequence Constraint
• Flow Shop Scheduling with Resource Flexibility
• Scheduling Parallel Manufacturing Cells with Resource Flexibility
• Airline Crew Scheduling with Time Windows and Plane-Count Constraints
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item