The Fixed Job Schedule Problem with Spread-Time Constraints

DOI10.1287/OPRE.35.6.849zbMATH Open0638.90055OpenAlexW2123862470MaRDI QIDQ3779989FDOQ3779989

Authors: Matteo Fischetti, Silvano Martello, Paolo Toth 

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

Recommendations

• The Fixed Job Schedule Problem with Working-Time Constraints
• Spread time considerations in operational fixed job scheduling
• Approximation Algorithms for Fixed Job Schedule Problems
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
• Tactical fixed job scheduling with spread-time constraints

zbMATH Keywords

lower boundsNP-hardreductionsbranch-and-boundaverage 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)

Cited In (30)

• Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
• Improving fleet utilization for carriers by interval scheduling
• A metaheuristic for the fixed job scheduling problem under spread time constraints
• Working time constraints in operational fixed job scheduling
• A fixed job scheduling problem with machine-dependent job weights
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Spread time considerations in operational fixed job scheduling
• The Fixed Job Schedule Problem with Working-Time Constraints
• Approximation Algorithms for Fixed Job Schedule Problems
• Solving a bus driver scheduling problem with randomized multistart heuristics
• An analysis of shift class design problems
• 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
• Breaking \(1-1/e\) barrier for nonpreemptive throughput maximization
• Greedy randomized adaptive search procedures
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
• A dynamic programming based algorithm for the crew scheduling problem.
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• On the continuous working problem
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• Maximizing the value of a space mission
• Cost constrained fixed job scheduling.
• A matheuristic for the driver scheduling problem with staff cars
• The optimal cost chromatic partition problem for trees and interval graphs
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
• A labeling method for dynamic driver-task assignment with uncertain task durations
• Routing trains through railway stations: Complexity issues

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

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