Scheduling tasks on moving executors to minimise the maximum lateness (Q5937357): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling with Multiple Performance Measures: The One-Machine Case / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3820362 / rank | |||
Normal rank | |||
Latest revision as of 18:17, 3 June 2024
scientific article; zbMATH DE number 1618938
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling tasks on moving executors to minimise the maximum lateness |
scientific article; zbMATH DE number 1618938 |
Statements
Scheduling tasks on moving executors to minimise the maximum lateness (English)
0 references
16 January 2002
0 references
scheduling theory
0 references
travelling salesman
0 references
optimisation
0 references
movement
0 references
flexible manufacturing systems
0 references
0 references
0 references
