Total completion time minimization in two-machine job shops with unit-time operations
type: Item
instance of: scholarly article
title: Total completion time minimization in two-machine job shops with unit-time operations
zbMATH Open document ID: 0953.90523
DOI: 10.1016/0377-2217(96)00132-4
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1252899
zbMATH Keywords: job shop
zbMATH Keywords: unit time operations
zbMATH Keywords: mean flow time
zbMATH Keywords: polynomial algorithm
author: Wieslaw Kubiak
author: Vadim G. Timkovsky
MaRDI profile type: Publication
full work available at URL: 0377-2217(96)00132-4
OpenAlex ID: W2089564682
cites work: Q4773298
cites work: Q3942735
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: A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
cites work: An efficient algorithm for a job shop problem
description: scientific article; zbMATH DE number 1252899