Pages that link to "Item:Q3392292"
From MaRDI portal
The following pages link to THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292):
Displaying 10 items.
- A single machine scheduling problem to minimize total early work (Q342425) (← links)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- A two-agent single-machine scheduling problem with late work criteria (Q1701708) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion (Q4689397) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
