A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
type: Item
instance of: scholarly article
title: A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
zbMATH Open document ID: 0879.68011
DOI: 10.1016/S0166-218X(96)00106-0
published in: Discrete Applied Mathematics
publication date: 1997-09-04T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1057107
zbMATH Keywords: scheduling problem
zbMATH Keywords: pseudopolynomial-time algorithms
author: Vadim G. Timkovsky
MaRDI profile type: Publication
cites work: Minimizing maximum lateness in a two-machine unit-time job shop
cites work: Q3942735
cites work: Q4131987
cites work: Q4198056
cites work: An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem
cites work: An efficient algorithm for a job shop problem
cites work: Total completion time minimization in two-machine job shops with unit-time operations
cites work: Computational Complexity of Discrete Optimization Problems
cites work: On general routing problems
cites work: Q3737196
cites work: Q3713852
OpenAlex ID: W2040466446
description: scientific article; zbMATH DE number 1057107