Polyhedral results for position-based scheduling of chains on a single machine
DOI10.1007/S10479-019-03180-8zbMATH Open1429.90024OpenAlexW2920014055MaRDI QIDQ2288972FDOQ2288972
Authors: Markó Horváth, Tamás Kis 
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03180-8
Recommendations
- Scheduling two chains of unit jobs on one machine: a polyhedral study
- Single-machine scheduling with precedence constraints and position-dependent processing times
- Single-Machine Scheduling Polyhedra with Precedence Constraints
- Scheduling chains with identical jobs and constant delays on a single machine
- A polyhedral approach to single-machine scheduling problems.
Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On defining sets of vertices of the hypercube by linear inequalities
- Algorithms for cost-aware scheduling
- Scheduling with variable time slot costs
- Complexity of Scheduling under Precedence Constraints
- Optimal scheduling for two-processor systems
- Complexity results for scheduling chains on a single machine
- NP-complete scheduling problems
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Scheduling problems with position dependent job processing times: computational complexity results
- Scheduling with AND/OR Precedence Constraints
- Scheduling jobs with position-dependent processing times
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- Non-approximability results for scheduling problems with minsum criteria
- Integer Programming
- Minimizing Total Tardiness on a Single Machine with Precedence Constraints
- On the complexity of scheduling unit-time jobs with or-precedence constraints
- Compact extended linear programming models
- On scheduling with non-increasing time slot cost to minimize total weighted completion time
Cited In (3)
This page was built for publication: Polyhedral results for position-based scheduling of chains on a single machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288972)
