Amanote Research
Register
Sign In
Flexible Flow Shop Scheduling With Stochastic Processing Times: A Decomposition-Based Approach
Computers and Industrial Engineering
- United Kingdom
doi 10.1016/j.cie.2012.04.001
Full Text
Open PDF
Abstract
Available in
full text
Categories
Engineering
Computer Science
Date
September 1, 2012
Authors
S.H. Choi
K. Wang
Publisher
Elsevier BV
Related search
Cooperative Co-Evolution Algorithm With an MRF-Based Decomposition Strategy for Stochastic Flexible Job Shop Scheduling
Mathematics
Mathematics
A Simheuristic for Bi-Objective Stochastic Permutation Flow Shop Scheduling Problem
Journal of Project Management
Flexible Job-Shop Scheduling Problems
Rule Based Heuristic Approach for Minimizing Total Flow Time in Permutation Flow Shop Scheduling
Tehnicki Vjesnik
Engineering
A New Proactive-Reactive Approach to Hedge Against Uncertain Processing Times and Unexpected Machine Failures in the Two-Machine Flow Shop Scheduling Problems
Scientia Iranica
Job Shop Scheduling With Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
a Restart Scheme Based Meta Heuristic for Flexible Job Shop Scheduling
International Journal of Mechanical and Production Engineering Research and Development
Transfer Processes
Fluid Flow
Mechanical Engineering
Aerospace Engineering
Flexible Job-Shop Scheduling Problem Based on Hybrid ACO Algorithm
International Journal of Simulation Modelling
Modeling
Computer Science Applications
Simulation
Bi-Objective Scheduling for Re-Entrant Hybrid Flow Shop With Learning Effect and Setup Times
Scientia Iranica
