The total completion time open shop scheduling problem with a given sequence of jobs on one machine
type: Item
instance of: scholarly article
title: The total completion time open shop scheduling problem with a given sequence of jobs on one machine
zbMATH Open document ID: 0994.90062
DOI: 10.1016/S0305-0548(01)00028-4
author: Ching-Fang Liaw
author: Chun-Yuan Cheng
author: Ming-Chih Chen
published in: Computers \& Operations Research
publication date: 2002-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1766547
MaRDI profile type: Publication
cites work: A new lower bound for the open-shop problem
cites work: The open shop scheduling problem with a given sequence of jobs on one machine
cites work: Scheduling the Open Shop to Minimize Mean Flow Time
cites work: A branch \(\&\) bound algorithm for the open-shop problem
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Classical and new heuristics for the open-shop problem: A computational evaluation
cites work: Constructive heuristic algorithms for the open shop problem
cites work: Q4841579
cites work: Shop scheduling problems under precedence constraints
cites work: Heuristic algorithms for the multiple knapsack problem
cites work: Algorithms for Solving Production-Scheduling Problems
cites work: Benchmarks for basic scheduling problems
cites work: Q4198056
full work available at URL: s0305-0548(01)00028-4
OpenAlex ID: W2045841722
description: scientific article; zbMATH DE number 1766547