The Fixed Job Schedule Problem with Working-Time Constraints

DOI10.1287/opre.37.3.395zbMath0672.90074OpenAlexW3128332557MaRDI QIDQ3826354

Matteo Fischetti, Paolo Toth, Silvano Martello

Publication date: 1989

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.37.3.395

zbMATH Keywords

computational experimentsbranch-and-boundlower boundsNP-hardpolynomial algorithmmaximum clique problemdominance criteriafixed job schedule problempreemptive caseworking-time constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (25)

Working time constraints in operational fixed job scheduling ⋮ Maximizing the value of a space mission ⋮ An analysis of shift class design problems ⋮ Branching strategies to improve regularity of crew schedules in ex-urban public transit ⋮ A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity ⋮ A new dominance procedure for combinatorial optimization problems ⋮ Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models ⋮ Resource allocation with time intervals ⋮ Exact and approximation algorithms for the operational fixed interval scheduling problem ⋮ Primal column generation framework for vehicle and crew scheduling problems ⋮ A dynamic programming based algorithm for the crew scheduling problem. ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems ⋮ Distributed algorithms for maximum cliques ⋮ Unnamed Item ⋮ Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ Solving a bus driver scheduling problem with randomized multistart heuristics ⋮ A labeling method for dynamic driver-task assignment with uncertain task durations ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution ⋮ Routing trains through railway stations: Complexity issues ⋮ Interval scheduling on identical machines ⋮ Pre-processing techniques for resource allocation in the heterogeneous case ⋮ Order selection on a single machine with high set-up costs

This page was built for publication: The Fixed Job Schedule Problem with Working-Time Constraints