A heuristic for the two-machine open-shop scheduling problem with transportation times
type: Item
instance of: scholarly article
title: A heuristic for the two-machine open-shop scheduling problem with transportation times
zbMATH Open document ID: 0941.90037
DOI: 10.1016/S0166-218X(99)00115-8
published in: Discrete Applied Mathematics
publication date: 2000-08-07T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B06
zbMATH DE Number: 1319815
zbMATH Keywords: open shop
zbMATH Keywords: transportation time
zbMATH Keywords: approximation
zbMATH Keywords: worst-case analysis
author: V. A. Strusevich
MaRDI profile type: Publication
cites work: Shop Problems With Two Machines and Time Lags
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Two-stage no-wait scheduling models with setup and removal times separated
cites work: Sequencing \(n\) jobs on two machines with arbitrary time lags
cites work: Open shop scheduling with delays
cites work: Two-machine open shop scheduling with special transportation times
cites work: Two machine open shop scheduling problem with setup, processing and removal times separated
cites work: An open shop scheduling problem with a non-bottleneck machine
cites work: On non-permutation solutions to some two machine flow shop scheduling problems
cites work: Sequencing n jobs on two machines with setup, processing and removal times separated
cites work: Short Shop Schedules
full work available at URL: s0166-218x(99)00115-8
OpenAlex ID: W1987867541
description: scientific article; zbMATH DE number 1319815