Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
type: Item
instance of: scholarly article
title: Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine
zbMATH Open document ID: 0922.90086
DOI: 10.1007/BF01585876
author: Steef van de Velde
author: Han Hoogeveen
published in: Mathematical Programming. Series A. Series B
publication date: 1999-10-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1294695
zbMATH Keywords: machine scheduling problems
zbMATH Keywords: mathematical formulation
zbMATH Keywords: positional completion times
zbMATH Keywords: batching
zbMATH Keywords: flow shop scheduling
zbMATH Keywords: total completion time
zbMATH Keywords: Lagrangian relaxation
MaRDI profile type: Publication
cites work: Batching and Scheduling Jobs on Batch and Discrete Processors
cites work: Minimizing total completion time in a two-machine flowshop: Analysis of special cases
cites work: New Lower and Upper Bounds for Scheduling Around a Small Common Due Date
description: scientific article; zbMATH DE number 1294695