Pages that link to "Item:Q5930732"
From MaRDI portal
The following pages link to Parallel machine scheduling with high multiplicity (Q5930732):
Displaying 21 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)
- Scheduling problem with multi-purpose parallel machines (Q496686) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
- Parallel machine scheduling with splitting jobs (Q1570839) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs (Q2286435) (← links)
- A note on the complexity of the problem of two-agent scheduling on a single machine (Q2385467) (← links)
- On the high multiplicity traveling salesman problem (Q2494812) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- Note on ``Parallel machine scheduling with batch setup times'' (Q2781100) (← links)
- Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation (Q3777787) (← links)
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518) (← links)
- High Multiplicity in Earliness-Tardiness Scheduling (Q4530664) (← links)
- Parallel Machine Scheduling: Impact of Adding Extra Machines (Q5166278) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
