Pages that link to "Item:Q3980518"
From MaRDI portal
The following pages link to Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem (Q3980518):
Displayed 38 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- The assignment problem with nearly Monge arrays and incompatible partner indices (Q335350) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
- Optimal packet-to-slot assignment in mobile telecommunications (Q833596) (← links)
- Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions (Q835601) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- An algorithm for the detection and construction of Monge sequences (Q1116656) (← links)
- A polynomial algorithm for an integer quadratic non-separable transportation problem (Q1198737) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- Families of non-IRUP instances of the one-dimensional cutting stock problem (Q1613404) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- Scheduling with safety distances (Q1897388) (← links)
- Heuristics for the integer one-dimensional cutting stock problem: A computational study (Q1919356) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- Feasibility criteria for high-multiplicity partitioning problems (Q2069802) (← links)
- New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints (Q2078845) (← 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)
- Packet scheduling in third-generation mobile systems with UTRA-TDD air interface (Q2480204) (← links)
- Batch scheduling in a two-level supply chain -- a focus on the supplier (Q2491787) (← links)
- On the high multiplicity traveling salesman problem (Q2494812) (← links)
- Low-complexity algorithms for sequencing jobs with a fixed number of job-classes (Q2564755) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- An asymptotically exact algorithm for the high-multiplicity bin packing problem (Q2570998) (← links)
- Parameterized complexity of configuration integer programs (Q2670456) (← links)
- Parallel approximation to high multiplicity scheduling problems<i>VIA</i>smooth multi-valued quadratic programming (Q3515460) (← links)
- Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
- Many Visits TSP Revisited (Q5874538) (← links)
- Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times (Q5888383) (← links)
- Scheduling a proportionate flow shop of batching machines (Q5919041) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)