Pages that link to "Item:Q2564876"

The following pages link to Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags (Q2564876):

Displaying 7 items.

• Polynomial-time approximation schemes for scheduling problems with time lags (Q600835) (← links)
• Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
• Scheduling of coupled tasks and one-machine no-wait robotic cells (Q954024) (← links)
• A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
• Minimizing flowtime for paired tasks (Q1751895) (← links)
• Heuristics for a coupled-operation scheduling problem (Q3512387) (← links)
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)