Scheduling tasks on moving executors to minimise the maximum lateness

DOI10.1016/S0377-2217(00)00058-8zbMath0978.90046MaRDI QIDQ5937357

Jerzy Józefczyk

Publication date: 16 January 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

flexible manufacturing systemsscheduling theorymovementoptimisationtravelling salesman

Mathematics Subject Classification ID

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

Related Items (1)

Worst‐case allocation algorithms in a complex of operations with interval parameters

Cites Work

• Unnamed Item
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• Scheduling with Multiple Performance Measures: The One-Machine Case
• State-space relaxation procedures for the computation of bounds to routing problems
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• An Optimal Algorithm for the Traveling Salesman Problem with Time Windows

This page was built for publication: Scheduling tasks on moving executors to minimise the maximum lateness