Complexity of shop-scheduling problems with fixed number of jobs: a survey
From MaRDI portal
Publication:2460037
Recommendations
Cites work
- A Geometric Model and a Graphical Algorithm for a Sequencing Problem
- A Non-Numerical Approach to Production Scheduling Problems
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
- An efficient algorithm for the job-shop problem with two jobs
- Complexity of mixed shop scheduling problems: A survey
- scientific article; zbMATH DE number 3871006 (Why is no real title available?)
- scientific article; zbMATH DE number 4154198 (Why is no real title available?)
- scientific article; zbMATH DE number 3989091 (Why is no real title available?)
- scientific article; zbMATH DE number 4099022 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 894722 (Why is no real title available?)
- Job-shop scheduling with multi-purpose machines
- NP-hardness of shop-scheduling problems with three jobs
- Open Shop Scheduling to Minimize Finish Time
- Optimal two- and three-stage production schedules with set-up time included
- Preemptive job-shop scheduling problems with a fixed number of jobs
- Scheduling two jobs with fixed and nonfixed routes
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Solution of the Akers-Friedman Scheduling Problem
- The complexity of shop-scheduling problems with two or three jobs
- The mixed shop scheduling problem
- Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
Cited in
(22)- The complexity of shop-scheduling problems with two or three jobs
- On scheduling cycle shops: Classification, complexity and approximation
- A study on integration of lot sizing and flow shop lot streaming problems
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- On the complexity of non-preemptive shop scheduling with two jobs
- NP-hardness of shop-scheduling problems with three jobs
- Parallel dedicated machines scheduling with chain precedence constraints
- Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
- Complexity of mixed shop scheduling problems: A survey
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Heuristic algorithms to maximize revenue and the number of jobs processed on parallel machines
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- Fair optimization and networks: a survey
- Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints
- scientific article; zbMATH DE number 3860868 (Why is no real title available?)
- Complete Complexity Classification of Short Shop Scheduling
- A new three-machine shop scheduling: complexity and approximation algorithm
- scientific article; zbMATH DE number 764421 (Why is no real title available?)
- An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
- Two-machine job-shop scheduling with one joint job
- Fifty years of research in scheduling -- theory and applications
- A neural network algorithm for servicing jobs with sequential and parallel machines
This page was built for publication: Complexity of shop-scheduling problems with fixed number of jobs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460037)
