Pages that link to "Item:Q4151721"
From MaRDI portal
The following pages link to An Application of Bin-Packing to Multiprocessor Scheduling (Q4151721):
Displaying 27 items.
- Machine scheduling performance with maintenance and failure (Q2643755) (← links)
- Parallel machine scheduling with nested processing set restrictions (Q2655610) (← links)
- Mathematical models and approximate solution approaches for the stochastic bin packing problem (Q2669539) (← links)
- A linear time approximation algorithm for multiprocessor scheduling (Q3048240) (← links)
- Performance of Heuristics for a Computer Resource Allocation Problem (Q3313258) (← links)
- On scheduling parallel machines with two setup classes (Q3354854) (← links)
- Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
- A Packing Problem You Can Almost Solve by Sitting on Your Suitcase (Q3718472) (← links)
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System (Q3951534) (← links)
- NP-Complete operations research problems and approximation algorithms (Q4187586) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- Analysis of partial setup strategies for solving the operational planning problem in parallel machine electronic assembly systems (Q4230119) (← links)
- A hierarchical approach for metal parts fabrication (Q4398972) (← links)
- Heuristic scheduling of parallel machines with sequence-dependent set-up times (Q4443334) (← links)
- (Q4526868) (← links)
- Scheduling with product family set-up times: an application in TFT LCD manufacturing (Q4671319) (← links)
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing (Q4807200) (← links)
- State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems (Q5084656) (← links)
- List-scheduling and column-generations for scheduling of n job-groups with set up time and due date through m identical parallel machines to minimize makespan (Q5292944) (← links)
- A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
- (Q5708542) (← links)
- Adaptive Bin Packing with Overflow (Q5870378) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties (Q6046629) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)
- The constrained parallel-machine scheduling problem with divisible processing times and penalties (Q6167009) (← links)
- Priority-based bin packing with subset constraints (Q6184311) (← links)