Pages that link to "Item:Q2460037"
From MaRDI portal
The following pages link to Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037):
Displaying 19 items.
- A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
- A neural network algorithm for servicing jobs with sequential and parallel machines (Q893921) (← links)
- The complexity of shop-scheduling problems with two or three jobs (Q1178530) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- A study on integration of lot sizing and flow shop lot streaming problems (Q1637796) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- On the complexity of non-preemptive shop scheduling with two jobs (Q1849563) (← links)
- NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs (Q1960324) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines (Q2290308) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints (Q2669504) (← links)
- Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)
- An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents (Q6087487) (← links)
- Two-machine job-shop scheduling with one joint job (Q6153460) (← links)