An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
From MaRDI portal
Publication:3964309
DOI10.1287/moor.7.3.354zbMath0498.90042OpenAlexW1963774625MaRDI QIDQ3964309
Publication date: 1982
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.7.3.354
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
A new lower bound for the job-shop scheduling problem, Job shop scheduling with unit time operations under resource constraints and release dates, An efficient algorithm for a job shop problem, Solving the job-shop scheduling problem optimally by dynamic programming, An efficient algorithm for the job-shop problem with two jobs, A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem, Makespan minimization in preemptive two machine job shops, An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents, Efficient algorithms for flexible job shop scheduling with parallel machines, A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem, Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem, Surrogate duality relaxation for job shop scheduling, On the geometry, preemptions and complexity of multiprocessor and shop scheduling, Open shop scheduling with machine dependent processing times, Scheduling partially ordered jobs faster than \(2^n\), On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion, Deterministic job-shop scheduling: Past, present and future, The job shop scheduling problem: Conventional and new solution techniques, Total completion time minimization in two-machine job shops with unit-time operations
