On bilevel machine scheduling problems
type: Item
instance of: scholarly article
title: On bilevel machine scheduling problems
zbMATH Open document ID: 1238.90067
author: Tamás Kis
author: András Kovács
published in: OR Spectrum
publication date: 2012-05-23T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6038001
zbMATH Keywords: scheduling
zbMATH Keywords: bilevel optimisation
zbMATH Keywords: max \(m\)-cut
zbMATH Keywords: linear programming
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: s00291-010-0219-y
OpenAlex ID: W2141594462
cites work: Scheduling Problems with Two Competing Agents
cites work: Q3425131
cites work: The Stackelberg minimum spanning tree game
cites work: Bilevel programming with knapsack constraints
cites work: Foundations of bilevel programming
cites work: Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Multicriteria scheduling
cites work: Bilevel programming applied to the flow shop scheduling problem
cites work: An Integrated Model for Job-Shop Planning and Scheduling
cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems
cites work: Production planning problem with sequence dependent setups as a bilevel programming problem
cites work: Q5717956
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Algorithmic mechanism design
cites work: Algorithms for Scheduling Independent Tasks
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
DOI: 10.1007/S00291-010-0219-Y
description: scientific article; zbMATH DE number 6038001