A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
DOI10.1007/S10951-021-00677-8OpenAlexW3139253831MaRDI QIDQ6204660FDOQ6204660
Authors: Kameng Nip, Zhenbo Wang
Publication date: 2 April 2024
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-021-00677-8
computational complexitylinear programmingjob shop schedulingflow shop schedulingopen shop scheduling
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling. Theory, algorithms, and systems.
- The Complexity of Flowshop and Jobshop Scheduling
- Open Shop Scheduling to Minimize Finish Time
- Computational Complexity of Discrete Optimization Problems
- Short Shop Schedules
- Title not available (Why is that?)
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Linear programming and its application.
- Makespan minimization in open shops: A polynomial time approximation scheme
- Scheduling under linear constraints
- Title not available (Why is that?)
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- Some graph optimization problems with weights satisfying linear constraints
- Approximability of flow shop scheduling
- Improved Approximation Algorithms for Shop Scheduling Problems
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- Title not available (Why is that?)
- Hardness of approximating flow and job shop scheduling problems
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- Bin packing under linear constraints
- Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
- Minimax linear programming problem
- Two-machine flow shop scheduling problem under linear constraints
- Knapsack with variable weights satisfying linear constraints
- Related machine scheduling with machine speeds satisfying linear constraints
This page was built for publication: A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204660)