Scheduling with safety distances

DOI10.1007/BF02099701MaRDI QIDQ1897388zbMATH OpenFDO

Authors Frits C. R. Spieksma, Zhongliang Yu, Gerhard J. Woeginger

Publication date 30 May 1996

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02099701

zbMATH Keywords

polynomial time algorithmsscheduling with safety distancestwo parallel machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Jobs with Temporal Distance Constraints
• Scheduling parallel machines with a single server: Some solvable cases and heuristics
• Scheduling with multiple servers
• scientific article; zbMATH DE number 3873052
• Job-shop scheduling in a body shop

Cites work

• Cyclic schedules for r irregularity occurring events
• scientific article; zbMATH DE number 3694971 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Optimal schedules for periodically recurring events
• Parallel machine scheduling with a common server
• Scheduling two irregular polygons
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

Cited in

(3)

• Equal processing and equal setup time cases of scheduling parallel machines with a single server
• Scheduling Jobs with Temporal Distance Constraints
• Scheduling Security Personnel for the Vancouver 2010 Winter Olympic Games

This page was built for publication: Scheduling with safety distances

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