Pages that link to "Item:Q1091256"
From MaRDI portal
The following pages link to Scheduling jobs with release dates and tails on identical machines to minimize the makespan (Q1091256):
Displaying 28 items.
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- Jackson's pseudo-preemptive schedule and cumulative scheduling problems (Q705501) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- A hybrid policy for order acceptance in batch process industries (Q850653) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem (Q882647) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- Nearly on line scheduling of preemptive independent tasks (Q1346697) (← links)
- Scheduling on uniform parallel machines to minimize maximum lateness (Q1577473) (← links)
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
- Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
- An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines (Q1870003) (← links)
- Makespan minimization on uniform parallel machines with release times (Q1877043) (← links)
- Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830) (← links)
- Scheduling jobs with release and delivery times subject to nested eligibility constraints (Q2033983) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem (Q2184136) (← links)
- Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Resolution approach for multi-objective problems with uncertain demands (Q2463490) (← links)
- The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price (Q2569096) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
