Pages that link to "Item:Q342425"
From MaRDI portal
The following pages link to A single machine scheduling problem to minimize total early work (Q342425):
Displaying 8 items.
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Mirror scheduling problems with early work and late work criteria (Q2066692) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- A no-delay single machine scheduling problem to minimize total weighted early and late work (Q6063508) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach (Q6106764) (← links)
