Pages that link to "Item:Q2434248"
From MaRDI portal
The following pages link to Parallel machine problems with equal processing times: a survey (Q2434248):
Displayed 11 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time (Q391321) (← links)
- A study of single-machine scheduling problem to maximize throughput (Q398860) (← links)
- Due-window assignment problems with unit-time jobs (Q902534) (← links)
- Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
- Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria (Q2356094) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan (Q2361139) (← links)
- The ``least flexible job first'' rule in scheduling and in queueing (Q2450742) (← links)