Two-machine open shop problem with controllable processing times

DOI10.1016/J.DISOPT.2006.10.010MaRDI QIDQ2467128zbMATH OpenOpenAlexFDO

Authors T. C. Edwin Cheng, N. V. Shakhlevich

Publication date 18 January 2008

Published in Discrete Optimization (Search for Journal in Brave)

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

zbMATH Keywords

controllable processing timesresource allocation problemKnapsack problemopen shop scheduling

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• A controlable two-machine flowshop scheduling problem
• Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs
• scientific article; zbMATH DE number 4010197
• Scheduling with controllable release dates and processing times: Makespan minimization

Cites work

• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 1302193 (Why is no real title available?)
• A survey of results for sequencing problems with controllable processing times
• A two-machine flow shop scheduling problem with controllable job processing times
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
• An Algorithm for Large Zero-One Knapsack Problems
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• Flow Shop Scheduling with Resource Flexibility
• Generalized polymatroids and submodular flows
• Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
• Job-shop scheduling with resource-time models of operations
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Minimization of the makespan in a two-machine problem under given resource constraints
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• Open Shop Scheduling to Minimize Finish Time
• Open shop scheduling problems with late work criteria.

Cited in

(7)

• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• A survey of scheduling with controllable processing times
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A 3/2 algorithm for two-machine open shop with route-dependent processing times
• Two-Machine Open Shops with Renewable Resources
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS

This page was built for publication: Two-machine open shop problem with controllable processing times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467128)