Pages that link to "Item:Q1041349"
From MaRDI portal
The following pages link to Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349):
Displaying 17 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- High-multiplicity cyclic job shop scheduling (Q957353) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria (Q1762126) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times (Q2393121) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- An exact framework for the discrete parallel machine scheduling location problem (Q2668759) (← links)
- Heuristic and exact algorithms for the identical parallel machine scheduling problem (Q2901015) (← links)
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518) (← links)
- Exact algorithms for scheduling multiple families of jobs on parallel machines (Q4456097) (← links)
- High Multiplicity in Earliness-Tardiness Scheduling (Q4530664) (← links)
- Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system (Q4661084) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Parallel machine scheduling with high multiplicity (Q5930732) (← links)
