A note on makespan minimization in proportionate flow shops (original) (raw)
Related papers
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop
European Journal of Operational Research, 2007
On the Minimization of the Makespan Subject to Flowtime Optimality
Operations Research, 1993
Minimizing Makespan with Start Time-Dependent Jobs in a Two-Machine Flow Shop
International Journal of Engineering, 2016
A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
Theoretical Computer Science, 2009
Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
Minimizing the Expected Makespan in Stochastic Flow Shops
Operations Research, 1982
Minimizing total weighted completion time in a proportionate flow shop
Journal of Scheduling, 1998
Minimizing makespan subject to minimum total flow-time on identical parallel machines
European Journal of Operational Research, 2000
Journal of Applied Probability, 1982
Minimizing flowtime subject to optimal makespan on two identical parallel machines
2000
Deterministic Job-Shop Scheduling: Past, Present and Future
European Journal of Operational Research, 1998
Minimizing makespan in a two-machine no-wait flow shop with batch processing machines
The International Journal of Advanced Manufacturing Technology, 2012
Minimising Makespan in the Two-Machine Flow-Shop with Release Times
The Journal of the Operational Research Society, 1998
Minimizing Makespan in a Batch-Processing Machine Flow Shop
2015
Sequence-dependent setup and clean-up times in a two-machine job-shop with minimizing makespan
Proceedings of the 12th IFAC Symposium on Information Control Problems in Manufacturing, Vol. 3, 2006, 51 - 56., 2006
An assignment-based lower bound for a class of two-machine flow shop problems
Computers & Operations Research, 2013
Mathematical programming, 1998
Sustainability
A Parametric Worst Case Analysis for a Machine Scheduling Problem Paul Mireault, Rakesh Vohra and
The International Journal of Advanced Manufacturing Technology, 2009
Minimizing Makespan in Job Shop Scheduling Problem with Parallel Machines
International Journal of Industrial Engineering Production Management, 2009
Production Scheduling on Parallel Machines Subject to Staircase Demands
Engineering Costs and Production Economics, 1988
Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines
Journal of Intelligent Manufacturing, 2011
Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines
Journal of Scheduling, 2010
Variants of the Two Machine Flow Shop Problem
Operations Research Proceedings, 1995
A note on the complexity of flow-shop scheduling with deteriorating jobs
Discrete Applied Mathematics, 2011
Makespan minimization in machine dominated flowshop
Applied Mathematics and Computation, 2010
Heuristic Flow‐Shop Scheduling to Minimize Sum of Job Completion Times
Canadian Journal of Administrative Sciences / Revue Canadienne des Sciences de l'Administration, 2009
Optimal makespan scheduling with given bounds of processing times
Mathematical and Computer Modelling, Vol. 26, No. 3, 1997, 67 - 86., 1997
Computers & Operations Research, 2010
Minimizing the Makespan in Two-Machine Job Shop Scheduling Problems with No Machine Idle-Time
Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics, 2009