A cutting plane algorithm for a single machine scheduling problem
type: Item
instance of: scholarly article
title: A cutting plane algorithm for a single machine scheduling problem
zbMATH Open document ID: 0990.90051
DOI: 10.1016/S0377-2217(99)00493-2
author: Kristina Šorić
published in: European Journal of Operational Research
publication date: 2000-12-19T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 1545199
zbMATH Keywords: single machine scheduling
zbMATH Keywords: mixed \(0-1\) programming problem
zbMATH Keywords: valid inequalities
zbMATH Keywords: branch and bound/cutting plane algorithm
MaRDI profile type: Publication
cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program
cites work: Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
cites work: Q4040221
cites work: Stable, distributed, real-time scheduling of flexible manufacturing/assembly/diassembly systems
cites work: A time indexed formulation of non-preemptive single machine scheduling problems
cites work: The CLWS heuristic for single machine scheduling problem
cites work: Uncapacitated Lot-Sizing Problems with Start-Up Costs
full work available at URL: s0377-2217(99)00493-2
OpenAlex ID: W1993738071
description: scientific article; zbMATH DE number 1545199