Two-machine open shop problem with controllable processing times

Authors:
T.C. Edwin Cheng;Natalia V. Shakhlevich
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;School of Computing, University of Leeds, Leeds LS2 9JT, UK
Venue:
Discrete Optimization
Year:
2007

Citing 7
Cited 0

Generalized polymatroids and submodular flows

Mathematical Programming: Series A and B
Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem

Information Processing Letters
A survey of results for sequencing problems with controllable processing times

Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
About strongly polynomial time algorithms for quadratic optimization over submodular constraints

Mathematical Programming: Series A and B
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Open shop scheduling problems with late work criteria

Discrete Applied Mathematics
Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a two-machine open shop problem in which the job processing times are controllable and can be compressed while incurring additional costs. We show that the problem of minimizing a linear compression cost function for a given upper bound on the makespan can be solved in O(n) time. For the bicriteria problem of minimizing the makespan and compression cost, we propose an O(nlogn) algorithm that finds all breakpoints of the efficient frontier.