Two-machine open shop problem with controllable processing times
From MaRDI portal
Publication:2467128
DOI10.1016/J.DISOPT.2006.10.010zbMATH Open1163.90484OpenAlexW2082755221MaRDI QIDQ2467128FDOQ2467128
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
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
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- A survey of results for sequencing problems with controllable processing times
- Title not available (Why is that?)
- An Algorithm for Large Zero-One Knapsack Problems
- Open Shop Scheduling to Minimize Finish Time
- Generalized polymatroids and submodular flows
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- A two-machine flow shop scheduling problem with controllable job processing times
- Title not available (Why is that?)
- Job-shop scheduling with resource-time models of operations
- Approximation schemes for job shop scheduling problems with controllable processing times
- Flow Shop Scheduling with Resource Flexibility
- Open shop scheduling problems with late work criteria.
- Minimization of the makespan in a two-machine problem under given resource constraints
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Genetic algorithm for the permutation flow-shop scheduling problem with linear models of operations
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds
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)
