Pages that link to "Item:Q1991261"
From MaRDI portal
The following pages link to A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan (Q1991261):
Displaying 10 items.
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs (Q2029301) (← links)
- A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Two-agent scheduling on a bounded parallel-batching machine with makespan and maximum lateness objectives (Q2176838) (← links)
- A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
- Two competitive agents to minimize the weighted total late work and the total completion time (Q2243272) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness (Q6164626) (← links)
