An efficient algorithm for the job-shop problem with two jobs
From MaRDI portal
Publication:1108919
DOI10.1007/BF02276919zbMath0654.90036OpenAlexW201573687MaRDI QIDQ1108919
Publication date: 1988
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02276919
Programming involving graphs or networks (90C35) 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, NP-hardness of shop-scheduling problems with three jobs, Job shop scheduling with unit length tasks, Shop scheduling problems with multiprocessor tasks on dedicated processors, Using mixed graph coloring to minimize total completion time in job shop scheduling, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, On the complexity of two machine job-shop scheduling with regular objective functions, Parallel dedicated machines scheduling with chain precedence constraints, An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents, Job-Shop Scheduling with Mixed Blocking Constraints between Operations, Two-machine job-shop scheduling with one joint job, The complexity of two-job shop problems with multi-purpose unrelated machines., Scheduling co-operating stacking cranes with predetermined container sequences, Job-shop scheduling in a body shop, A job-shop problem with one additional resource type, The Machine Duplication Problem in a Job Shop with Two Jobs, Advice Complexity and Barely Random Algorithms, Job-shop scheduling with multi-purpose machines, Complexity of mixed shop scheduling problems: A survey, The complexity of shop-scheduling problems with two or three jobs, Complexity of shop-scheduling problems with fixed number of jobs: a survey, Online algorithms with advice: the tape model, An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling, Advice Complexity and Barely Random Algorithms, On the power of randomization for job shop scheduling withk-units length tasks, Lower bounds for the job-shop scheduling problem on multi-purpose machines, Deterministic job-shop scheduling: Past, present and future, The job shop scheduling problem: Conventional and new solution techniques, Reduction of job-shop problems to flow-shop problems with precedence constraints, Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function, Scheduling two jobs with fixed and nonfixed routes
Cites Work
