Pages that link to "Item:Q3200872"

The following pages link to Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872):

Displaying 10 items.

• Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)
• A mixed integer formulation and an efficient metaheuristic for the unrelated parallel machine scheduling problem: total tardiness minimization (Q6114940) (← links)
• Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness (Q6167662) (← links)
• The parcel hub scheduling problem with limited conveyor capacity and controllable unloading speeds (Q6176180) (← links)
• Order acceptance and scheduling with delivery under generalized parameters (Q6179281) (← links)
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders (Q6195034) (← links)
• Robust scheduling for minimizing maximum lateness on a serial-batch processing machine (Q6551700) (← links)
• Single-machine primary-secondary scheduling with total tardiness being the primary criterion (Q6577347) (← links)