The Fixed Job Schedule Problem with Spread-Time Constraints

DOI10.1287/OPRE.35.6.849zbMath0638.90055OpenAlexW2123862470MaRDI QIDQ3779989

Paolo Toth, Silvano Martello, Matteo Fischetti

Publication date: 1987

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

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

zbMATH Keywords

branch-and-boundlower boundsNP-hardreductionsaverage performancedominance criteriabus driver schedulingpolynomial special casesfixed job schedule problempreemptive case

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (26)

Working time constraints in operational fixed job scheduling ⋮ Maximizing the value of a space mission ⋮ An analysis of shift class design problems ⋮ A fixed job scheduling problem with machine-dependent job weights ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity ⋮ Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ A metaheuristic for the fixed job scheduling problem under spread time constraints ⋮ Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models ⋮ Exact and approximation algorithms for the operational fixed interval scheduling problem ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ A dynamic programming based algorithm for the crew scheduling problem. ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems ⋮ A matheuristic for the driver scheduling problem with staff cars ⋮ Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization ⋮ 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 ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm ⋮ The optimal cost chromatic partition problem for trees and interval graphs ⋮ Greedy randomized adaptive search procedures ⋮ A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution ⋮ Routing trains through railway stations: Complexity issues ⋮ Spread time considerations in operational fixed job scheduling

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