Computational Complexity of Discrete Optimization Problems
From MaRDI portal
Publication:4198060
Cited in
(68)- The robot sequencing problem: polynomial algorithm and complexity
- A new lower bound for the job-shop scheduling problem
- List scheduling algorithms to minimize the makespan on identical parallel machines
- Job shop scheduling with unit time operations under resource constraints and release dates
- Complexity, bounds and dynamic programming algorithms for single track train scheduling
- Semiconductor final-test scheduling under setup operator constraints
- An exact algorithm for the identical parallel machine scheduling problem.
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
- Task scheduling with and without communication delays: A unified approach
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem
- Scheduling subject to nonrenewable-resource constraints
- Efficient algorithms for flexible job shop scheduling with parallel machines
- On the power of randomization for job shop scheduling withk-units length tasks
- Parameterized complexity of machine scheduling: 15 open problems
- Hybrid rollout approaches for the job shop scheduling problem
- Scheduling the truckload operations in automatic warehouses
- Complexity analysis of job-shop scheduling with deteriorating jobs
- An efficient algorithm for a job shop problem
- Output rate variation problem: some heuristic paradigms and dynamic programming
- Is a unit-job shop not easier than identical parallel machines?
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- Arc-B-consistency of the inter-distance constraint
- Batch scheduling on two-machine flowshop with machine-dependent setup times
- On the exact solution of the no-wait flow shop problem with due date constraints
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles
- Combinations of some shop scheduling problems and the shortest path problem: complexity and approximation algorithms
- No-wait job shop scheduling: tabu search and complexity of subproblems
- Variables selection using \(\mathcal{L}_0\) penalty
- Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms
- A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
- An appraisal of computational complexity for operations researchers
- Job-shop scheduling with processing alternatives.
- Complexity of mixed shop scheduling problems: A survey
- An effective lower bound on \(L_{\max}\) in a worker-constrained job shop
- Solving the job-shop scheduling problem optimally by dynamic programming
- Complexity results for scheduling chains on a single machine
- Adaptive temperature control for simulated annealing: a comparative study
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
- Surrogate duality relaxation for job shop scheduling
- Instance space analysis and algorithm selection for the job shop scheduling problem
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
- A study on several combination problems of classic shop scheduling and shortest path
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
- Open-shop batch scheduling with identical jobs
- The job shop scheduling problem: Conventional and new solution techniques
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
- An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
- Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
- An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
- A new hybrid parallel genetic algorithm for the job-shop scheduling problem
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem
- Deterministic job-shop scheduling: Past, present and future
- Minimizing maximum lateness in a two-machine unit-time job shop
- Batch scheduling on a two-machine jobshop with machine-dependent setup times
- Approximative procedures for no-wait job shop scheduling.
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic
- On scheduling cycle shops: Classification, complexity and approximation
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
- Evolution based learning in a job shop scheduling environment
- Mixed graph colouring as scheduling multi-processor tasks with equal processing times
- Towards tight lower bounds for scheduling problems
- A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources
- A hybrid genetic algorithm for the job shop scheduling problem
- Joint production and transportation scheduling in flexible manufacturing systems
This page was built for publication: Computational Complexity of Discrete Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198060)
