The one-machine sequencing problem
type: Item
instance of: scholarly article
title: The one-machine sequencing problem
zbMATH Open document ID: 0482.90045
DOI: 10.1016/S0377-2217(82)80007-6
author: Jacques Carlier
published in: European Journal of Operational Research
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3758065
zbMATH Keywords: one-machine sequencing
zbMATH Keywords: efficient branch and bound methods
zbMATH Keywords: tree-search
zbMATH Keywords: Schrage schedule
zbMATH Keywords: minimization of makespan
zbMATH Keywords: NP-hardness
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
cites work: Sequencing with due-dates and early start times to minimize maximum tardiness
cites work: On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem
cites work: Q4198056
cites work: Q4170510
cites work: Minimizing maximum lateness on one machine: computational experience and some applications
cites work: Q5650538
description: scientific article; zbMATH DE number 3758065