An efficient algorithm for the job-shop problem with two jobs

DOI10.1007/BF02276919zbMATH Open0654.90036OpenAlexW201573687MaRDI QIDQ1108919FDOQ1108919

Authors: Peter Brucker 

Publication date: 1988

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02276919

Recommendations

• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• scientific article; zbMATH DE number 4137518
• An efficient algorithm for a job shop problem
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem

zbMATH Keywords

shortest pathjob-shop schedulingobstacles in the planespecial networktwo jobs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
• Adjustment of heads and tails for the job-shop problem
• A Geometric Model and a Graphical Algorithm for a Sequencing Problem
• Solution of the Akers-Friedman Scheduling Problem

Cited In (36)

• Job-shop scheduling in a body shop
• A new lower bound for the job-shop scheduling problem
• Advice complexity and barely random algorithms
• Two-machine job-shop scheduling with one joint job
• Parallel dedicated machines scheduling with chain precedence constraints
• Job-shop scheduling with mixed blocking constraints between operations
• 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 power of randomization for job shop scheduling withk-units length tasks
• An efficient algorithm for a job shop problem
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Job shop scheduling with unit length tasks
• Advice complexity and barely random algorithms
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• Scheduling two jobs with fixed and nonfixed routes
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Efficiency of reductions of job-shop to flow-shop problems
• Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• NP-hardness of shop-scheduling problems with three jobs
• Complexity of mixed shop scheduling problems: A survey
• The complexity of two-job shop problems with multi-purpose unrelated machines.
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• On the complexity of two machine job-shop scheduling with regular objective functions
• An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents
• The complexity of shop-scheduling problems with two or three jobs
• The job shop scheduling problem: Conventional and new solution techniques
• The Machine Duplication Problem in a Job Shop with Two Jobs
• Scheduling co-operating stacking cranes with predetermined container sequences
• Deterministic job-shop scheduling: Past, present and future
• Job-shop scheduling with multi-purpose machines
• A job-shop problem with one additional resource type
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• Lower bounds for the job-shop scheduling problem on multi-purpose machines
• Title not available (Why is that?)
• Online algorithms with advice: the tape model

This page was built for publication: An efficient algorithm for the job-shop problem with two jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108919)