Pages that link to "Item:Q947338"
From MaRDI portal
The following pages link to Lower bounds for parallel machine scheduling problems (Q947338):
Displaying 24 items.
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219) (← links)
- Lower bounds for scheduling on identical parallel machines with heads and tails (Q596460) (← links)
- Range of lower bounds (Q648257) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
- Note on Shim and Kim's lower bounds for scheduling on identical parallel machines to minimize total tardiness (Q1011327) (← links)
- On lower bounds on the minimum maximum lateness on one machine subject to release date (Q1096536) (← links)
- Improved bounds on relaxations of a parallel machine scheduling problem (Q1383802) (← links)
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- Lower bounds on precedence-constrained scheduling for parallel processors. (Q1853033) (← links)
- On lower and upper bounds for single machine parallel batch scheduling (Q2091210) (← links)
- Multi-machine scheduling lower bounds using decision diagrams (Q2294251) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608) (← links)
- Scheduling jobs on parallel machines to minimize a regular step total cost function (Q2434254) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time (Q2664351) (← links)
- Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop (Q2890475) (← links)
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions (Q3166272) (← links)
- Lower bounds for single-machine scheduling problems (Q3211098) (← links)
- Bounds for naive multiple machine scheduling with release times and deadlines (Q3319773) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems (Q5470732) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
