Pages that link to "Item:Q1580983"
From MaRDI portal
The following pages link to Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983):
Displaying 24 items.
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines (Q459788) (← links)
- Minimizing the makespan in nonpreemptive parallel machine scheduling problem (Q655176) (← links)
- Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system (Q954048) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Minimizing flow time in cyclic schedules for identical jobs with acyclic precedence: The bottleneck lower bound. (Q1400347) (← links)
- An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
- The coupled unit-time operations problem on identical parallel machines with respect to the makespan (Q1667166) (← links)
- Minimizing the makespan on two identical parallel machines with mold constraints (Q1722974) (← links)
- Scheduling with time-of-use costs (Q1755384) (← links)
- Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem (Q1791932) (← links)
- On the minimization of total weighted flow time with identical and uniform parallel machines (Q1806644) (← links)
- Makespan minimization subject to flowtime optimality on identical parallel machines (Q1885968) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
- Minimizing Makespan on Parallel Machines with Machine Eligibility Restrictions (Q3192848) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)
- Minimizing Flow Time on Parallel Identical Processors with Variable Unit Processing Time (Q3691406) (← links)
- On the Minimization of the Makespan Subject to Flowtime Optimality (Q4272903) (← links)
- Minimizing makespan in parallel flowshops (Q4356676) (← links)
- Minimizing flowtime subject to optimal makespan on two identical parallel machines (Q5189089) (← links)
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time (Q6090472) (← links)
- Bicriteria multi-machine scheduling with equal processing times subject to release dates (Q6145328) (← links)
