An iterative improvement approach for the nonpreemptive open shop scheduling problem
type: Item
instance of: scholarly article
title: An iterative improvement approach for the nonpreemptive open shop scheduling problem
zbMATH Open document ID: 0937.90032
DOI: 10.1016/S0377-2217(97)00366-4
author: Ching-Fang Liaw
published in: European Journal of Operational Research
publication date: 2000-06-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1358438
zbMATH Keywords: scheduling theory
zbMATH Keywords: Bender's decomposition
zbMATH Keywords: sequencing
zbMATH Keywords: makespan
MaRDI profile type: Publication
cites work: Open-shop scheduling problems with dominated machines
cites work: Q3056948
cites work: Q3496142
cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling
cites work: An Algorithm for the Open-Shop Problem
cites work: Q4198056
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Q4040221
cites work: Q3525910
cites work: Q3670909
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
cites work: Q3138949
cites work: Q4841579
description: scientific article; zbMATH DE number 1358438