Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem

DOI10.1016/j.ejor.2004.04.014zbMath1066.90026OpenAlexW2056647478MaRDI QIDQ1772847

Natalia V. Shakhlevich, Cheng, T. C. Edwin

Publication date: 21 April 2005

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

Full work available at URL: http://hdl.handle.net/10397/663

zbMATH Keywords

SchedulingParallel machine schedulingOpen shop schedulingSeparable non-decreasing function

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Openshop and flowshop scheduling to minimize sum of completion times
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On the solution region for certain scheduling problems with preemption
• Solution of the generalized Townsend single machine scheduling model
• Geometric algorithms and combinatorial optimization.
• A primal-dual interior point method whose running time depends only on the constraint matrix
• Scheduling with Deadlines and Loss Functions
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• On the facial structure of scheduling polyhedra
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• The Single Machine Problem with a Quadratic Cost Function of Completion Times
• Preemptive Scheduling with Due Dates
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
• Single-Machine Scheduling Polyhedra with Precedence Constraints
• Open shop problems with unit time operations
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Some simple scheduling algorithms
• Scheduling independent tasks to reduce mean finishing time
• Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure