A note on the complexity of the concurrent open shop problem
type: Item
instance of: scholarly article
title: A note on the complexity of the concurrent open shop problem
zbMATH Open document ID: 1154.90484
author: Thomas A. Roemer
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153372
zbMATH Keywords: Order scheduling
zbMATH Keywords: Total completion time
zbMATH Keywords: Complexity
zbMATH Keywords: Internal and external performance measures
MaRDI profile type: Publication
full work available at URL: s10951-006-7042-y
OpenAlex ID: W2159158649
cites work: Coordinated scheduling of customer orders for quick response
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
cites work: Order scheduling in an environment with dedicated resources in parallel
cites work: Scheduling orders for multiple product types to minimize total weighted completion time
cites work: Q5702308
cites work: Open shops with jobs overlap -- revisited
cites work: Concurrent open shop scheduling to minimize the weighted number of tardy jobs
cites work: Q3525911
cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation
cites work: Open shops with jobs overlap
cites work: The complexity of customer order scheduling problems on parallel machines
cites work: Scheduling parallel machines for the customer order problem
DOI: 10.1007/S10951-006-7042-Y
description: scientific article; zbMATH DE number 5153372