Scheduling under linear constraints

DOI10.1016/j.ejor.2016.02.028zbMath1346.90376arXiv1510.08551OpenAlexW2211598476MaRDI QIDQ323163

Kameng Nip, Zizhuo Wang, Zhen-bo Wang

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.08551

zbMATH Keywords

computational complexitylinear programmingapproximation algorithmparallel machine scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Bin packing under linear constraints ⋮ Knapsack with variable weights satisfying linear constraints ⋮ A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints ⋮ Parallel machine scheduling with speed-up resources ⋮ Some graph optimization problems with weights satisfying linear constraints ⋮ Related machine scheduling with machine speeds satisfying linear constraints

Cites Work

• Mixed-integer bilinear programming problems
• A survey of results for sequencing problems with controllable processing times
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• A two-machine flow shop scheduling problem with controllable job processing times
• Lot sizing and scheduling -- survey and extensions
• Lotsizing and scheduling for production planning
• A survey of scheduling with controllable processing times
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• Solving Mixed Integer Bilinear Problems Using MILP Formulations
• Approximation in stochastic scheduling
• Planning and Scheduling in Manufacturing and Services
• Stochastic scheduling problems I — General strategies
• Algorithms for Scheduling Independent Tasks
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
• Combinatorial optimization. Theory and algorithms.
• Scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling under linear constraints