An efficient algorithm for a job shop problem
type: Item
instance of: scholarly article
title: An efficient algorithm for a job shop problem
zbMATH Open document ID: 0838.90064
DOI: 10.1007/BF02099698
author: Suresh P. Sethi
author: Wieslaw Kubiak
author: Chelliah Sriskandarajah
published in: Annals of Operations Research
publication date: 1995-08-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 790517
zbMATH Keywords: makespan
zbMATH Keywords: two-machine job shop
zbMATH Keywords: unit processing time operations
MaRDI profile type: Publication
cites work: Scheduling unit-time tasks with integer release times and deadlines
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Flowshop and Jobshop Schedules: Complexity and Approximation
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
cites work: Q4124328
cites work: Computational Complexity of Discrete Optimization Problems
cites work: Some no-wait shops scheduling problems: Complexity aspect
full work available at URL: https://doi.org/10.1007/bf02099698
OpenAlex ID: W3122988155
description: scientific article; zbMATH DE number 790517