The Fixed Job Schedule Problem with Working-Time Constraints

DOI10.1287/OPRE.37.3.395MaRDI QIDQ3826354zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Silvano Martello, Paolo Toth

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

lower boundscomputational experimentsNP-hardpolynomial algorithmbranch-and-boundmaximum 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)

Recommendations

• The Fixed Job Schedule Problem with Spread-Time Constraints
• Working time constraints in operational fixed job scheduling
• scientific article; zbMATH DE number 1882989
• Approximability of scheduling with fixed jobs
• On the fixed interval due-date scheduling problem
• scientific article; zbMATH DE number 781213
• Approximation Algorithms for Fixed Job Schedule Problems
• Flexible job-shop scheduling problem under resource constraints
• A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
• Conjugate problems in time-dependent scheduling

Cited in

(32)

• Routing trains through railway stations: Complexity issues
• A labeling method for dynamic driver-task assignment with uncertain task durations
• scientific article; zbMATH DE number 7765369 (Why is no real title available?)
• Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
• Interval scheduling on identical machines
• Working time constraints in operational fixed job scheduling
• Bounds for the cardinality constrained \(P \|C_{max}\) problem
• Algorithms for large scale shift minimisation personnel task scheduling problems
• Scheduling jobs with fixed start and end times
• A new dominance procedure for combinatorial optimization problems
• Order selection on a single machine with high set-up costs
• The Fixed Job Schedule Problem with Spread-Time Constraints
• Approximation Algorithms for Fixed Job Schedule Problems
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions
• Pre-processing techniques for resource allocation in the heterogeneous case
• An analysis of shift class design problems
• Solving a bus driver scheduling problem with randomized multistart heuristics
• A constraint-based approach for the shift design personnel task scheduling problem with equity
• Distributed algorithms for maximum cliques
• Resource allocation with time intervals
• Primal column generation framework for vehicle and crew scheduling problems
• A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
• A dynamic programming based algorithm for the crew scheduling problem.
• Approximations for Throughput Maximization
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• On the continuous working problem
• Branching strategies to improve regularity of crew schedules in ex-urban public transit
• Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
• Maximizing the value of a space mission
• Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models
• The optimal cost chromatic partition problem for trees and interval graphs
• A triplet-based exact method for the shift minimisation personnel task scheduling problem

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

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