Pages that link to "Item:Q2569171"
From MaRDI portal
The following pages link to A framework for the complexity of high-multiplicity scheduling problems (Q2569171):
Displaying 28 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)
- Perfect periodic scheduling for three basic cycles (Q398898) (← links)
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- Simultaneous optimization of classical objectives in JIT scheduling (Q879282) (← links)
- Response time variability (Q880584) (← links)
- Scheduling and fixed-parameter tractability (Q896271) (← links)
- Identical coupled task scheduling: polynomial complexity of the cyclic case (Q906560) (← links)
- Identical part production in cyclic robotic cells: Concepts, overview and open questions (Q955314) (← links)
- Throughput optimization in two-machine flowshops with flexible operations (Q983633) (← links)
- Single machine scheduling with forbidden start times (Q1022436) (← links)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- The complexity of multidimensional periodic scheduling (Q1281399) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times (Q1799381) (← links)
- Many-visits TSP revisited (Q2051856) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Modeling and solving the periodic maintenance problem (Q2488905) (← links)
- High Multiplicity Scheduling with Switching Costs for Few Products (Q2806978) (← links)
- Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
- From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective (Q3637390) (← 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)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- A multivariate complexity analysis of the material consumption scheduling problem (Q6136081) (← links)
- Solving an unrelated parallel machines scheduling problem with machine- and job-dependent setups and precedence constraints considering support machines (Q6551117) (← links)
