Pages that link to "Item:Q3987785"
From MaRDI portal
The following pages link to A proof for the longest-job-first policy in one-machine scheduling (Q3987785):
Displaying 15 items.
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
- Mimimization of agreeably weighted variance in single machine systems (Q1127158) (← links)
- A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval (Q1793403) (← links)
- Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- Bi-objective single machine scheduling problem with stochastic processing times (Q2343079) (← links)
- Scheduling with monotonous earliness and tardiness penalties (Q2366084) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- Scheduling of storage/retrieval orders under a just-in-time environment (Q4399129) (← links)
- Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees (Q5106351) (← links)
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167) (← links)
- Self-adaptive biased differential evolution for scheduling against common due dates (Q6579091) (← links)
