Filters








4,586 Hits in 6.1 sec

Min-Max Regret Version of an m-Machine Ordered Flow Shop with Uncertain Processing Times

Myoung-Ju Park, Byung-Cheon Choi
2015 Management Science and Financial Engineering  
We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain.  ...  Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios.  ...  This paper considers only the discrete scenario case. We consider an m-machine flow shop scheduling problem, in which the performance measure is the makespan.  ... 
doi:10.7737/msfe.2015.21.1.001 fatcat:r46x2fpsanetvd5sfzfqkeurge

A New Approach Generating Robust and Stable Schedules in m-Machine Flow Shop Scheduling Problems: A Case Study

2020 International Journal of Engineering  
Thus, a two-stage predictive algorithm is proposed to efficiently handle the uncertainties and find robust and stable solutions.  ...  This paper considers a scheduling problem with uncertain processing times and machine breakdowns in industriall/office workplaces and solves it via a novel robust optimization method.  ...  When there is significant uncertainty in job processing times that cannot be approximated with a probability distribution, discrete scenarios offer a good representation of uncertainty [15, 18] .  ... 
doi:10.5829/ije.2020.33.02b.14 fatcat:ngxfjvqsajbwjhmcmy4xkx4p2a

Heuristic algorithms for the minmax regret flow-shop problem with interval processing times

Michał Ćwik, Jerzy Józefczyk
2017 Central European Journal of Operations Research  
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered.  ...  Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations are applied to simplify the optimization procedure.  ...  Namely, the proof of its NP-hardness is given in Daniels et al. (2000) , the problem with two jobs is studied by Averbakh (2006) , the problem with two machines and discrete scenarios is discussed in  ... 
doi:10.1007/s10100-017-0485-8 pmid:29375268 pmcid:PMC5767222 fatcat:nme35j777fhfrikimxx4u7mu7i

Shop floor lot-sizing and scheduling with a two-stage stochastic programming model considering uncertain demand and workforce efficiency

Yihua Li, Guiping Hu
2017 Computers & industrial engineering  
In this study, a two-stage stochastic programming model is proposed to solve a single-machine, multi-product shop floor lot-sizing and scheduling problem.  ...  In this study, a two-stage stochastic programming model is proposed to solve a single-machine, multi-product shop floor lot-sizing and scheduling problem.  ...  This gap is filled with a discretization approach called scenario generation.  ... 
doi:10.1016/j.cie.2017.07.014 fatcat:beacivu4sffhnocrnkkumhbs7u

A Data-Driven Robust Scheduling Method Integrating Particle Swarm Optimization Algorithm with Kernel-Based Estimation

Peng Zheng, Peng Zhang, Ming Wang, Jie Zhang
2021 Applied Sciences  
Robust scheduling methods aim to optimize the given criteria for improving the robustness of the schedule by organizing the assembly processes under uncertainty.  ...  Secondly, an interval scheduling method constructed using interval theory and a customized discrete PSO algorithm are used to optimize the AJSSP with assembly constraints.  ...  All the previous studies focused on the classic flow-shop or job-shop scheduling problems under uncertainty and did not consider the assembly process.  ... 
doi:10.3390/app11125333 fatcat:gq6r4aztxjdmpatcye6dgxroyy

Enhancement of Multiprocessors Job Shop Scheduling with Heterogeneous Workers Using Particle Swarm Optimization

Shun-chi YU
2019 DEStech Transactions on Engineering and Technology Research  
Given that multiprocessor job shop scheduling is applicable to the actual production scenarios, this study chooses multiprocessor job shop with heterogeneous workers scheduling as the subject.  ...  This study oriented to the multiprocessor job shop scheduling takes the heterogeneous workers with related subsidies as the constraining factors and endeavors to seek the best solutions to the problem.  ...  Scheduling considering learning effect is applied to solve a comparison of two stage-based hybrid algorithms for a batch scheduling problem in hybrid flow shop (Sakawa & Kubota, 2001) .  ... 
doi:10.12783/dtetr/amsms2019/31866 fatcat:tdlga5fozvbwhk2szgx3wphn44

Optimizing integrated terminal airspace operations under uncertainty

Christabelle Bosson, Min Xue, Shannon Zelinski
2014 2014 IEEE/AIAA 33rd Digital Avionics Systems Conference (DASC)  
Recent research has developed geneticalgorithm-based schedulers for integrated arrival and departure operations under uncertainty.  ...  This paper presents an alternate method using a machine jobshop scheduling formulation to model the integrated airspace operations.  ...  Machine Job-Shop Modeling In this paper, a machine job-shop scheduling formulation is derived from operation research and adapted to model the integrated departure/arrival operations in the terminal airspace  ... 
doi:10.1109/dasc.2014.6979400 fatcat:fvoenvncbbberkwdnjxnqv5r6m

Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research

I. Sabuncuoglu, S. Goren
2009 International journal of computer integrated manufacturing (Print)  
In practice, however, scheduling systems operate in dynamic and stochastic environments. Hence, there is a need to incorporate both uncertainty and dynamic elements into the scheduling process.  ...  Scheduling is a decision-making process that is concerned with the allocation of limited resources to competing tasks (operations of jobs) over a time period with the goal of optimizing one or more objectives  ...  Guo and Nanoka (1999) study stability in a 3-machine flow shop where the performance measure is makespan and the middle machine is subject to a single machine breakdown.  ... 
doi:10.1080/09511920802209033 fatcat:zb4xsuzlx5fdpomkuxwpkn5cw4

Heuristic Algorithm for Uncertain Permutation Flow-shop Problem

Jerzy Józefczyk, Michał Ćwik
2016 Proceedings of the 1st International Conference on Complex Information Systems  
Heuristic Algorithm for Uncertain Permutation Flow-shop Problem. 119 2 1 n j J J J J ... J  ...  The uncertain version of a permutation flow-shop problem with interval execution times is considered. The worst-case regret based on the makespan is used for the evaluation of permutations of tasks.  ...  For example, it is 2-approximate algorithm for the special case of flow-shop problem considered in the paper with only two machines (m = 2).  ... 
doi:10.5220/0005874401190127 dblp:conf/complexis/JozefczykC16 fatcat:kigi36gpxfexpd54y7v5rkyszq

Energy Efficiency Improvement through Optimal Batch Sizing in Job Shop

Samira Alvandi
2020 Modern Applied Science  
The applicability of the proposed framework is demonstrated through a real-life job-shop environment with the focus on optimisation of energy as well as job tardiness.  ...  This research aims to overcome the multi-faceted objectives of small and medium-sized enterprises (SME’s) by providing a simulation-optimisation platform that creates the best possible production  ...  Fang et al. (2011) developed a multi-objective model for optimizing production schedule of a flow shop.  ... 
doi:10.5539/mas.v14n10p6 fatcat:gxjec3xtmfao7nbciguveqgjb4

An Approach of Preventive Maintenance for Dynamic Systems under Uncertainty

Dan George Tonţ, Gabriela Tonţ
2008 Journal of Electrical and Electronics Engineering  
It is an initialattempt to formalize the short-term scheduling problemwith operational uncertainties.  ...  Theeffectiveness of the approach as a decision-support tool ispresented in a case study.  ...  A similar proactive scheduling approach was developed in [4] for a two-machine flow shop environment, where the scenario-based and intervals representations of processing times were discussed, and the  ... 
doaj:ee0fe891065941b58bcae407300b5a47 fatcat:4xqqgv5c65gt5ioycujx4cyjfq

Scheduling Algorithms for a Hybrid Flow Shop under Uncertainty

Christin Schumacher, Peter Buchholz
2020 Algorithms  
The problem is a hybrid flow shop with two stages, machine qualifications, skipping stages, and uncertainty in demands. The objective is to minimize the makespan.  ...  for obtaining machine schedules.  ...  Conclusions In this paper, we solve a hybrid flow shop scheduling problem under uncertainties derived from a real industrial use case.  ... 
doi:10.3390/a13110277 fatcat:tesi7dbjmjbuzie6yt7z6hiiki

Productivity Improvement Through Multi-Objective Simulation Optimization—A Case Study

Mohammad M. Aldurgam, Mohammed Y. Alghadeer, Mohammad A. M. Abdel-Aal, Shokri Z. Selim
2019 IEEE Access  
Using discrete-event system simulation and optimization, this paper investigates different scenarios to enhance operations efficiency and presents a decision support tool to aid operational decision making  ...  INDEX TERMS Decision support, discrete-event system simulation, simulation optimization, multiobjective simulation optimization. 40230 2169-3536  ...  [43] utilized DESS to model and optimize job scheduling in a multi-machine job shop manufacturing system.  ... 
doi:10.1109/access.2019.2907403 fatcat:cr5nsfy73nel7pxbfllu7sq3be

A novel modeling approach for job shop scheduling problem under uncertainty

Behnam Beheshti Pur, Siamak Noori, Reza Hosnavi Atashgah
2013 Management Science Letters  
under some practical assumptions.  ...  Although a common workshop is full of uncertainties, when using mathematical programs researchers have mainly focused on deterministic problems.  ...  For example, Gu & Lu (2009) devised an online approximate policy for the preemptive stochastic online scheduling on two uniform machines and Gourgand et al. (2003) developed a recursive algorithm to  ... 
doi:10.5267/j.msl.2013.10.006 fatcat:6cri3kjaojgv5ky2bpz37wnamu

Designing robust layout in cellular manufacturing systems with uncertain demands

Kamran Forghani, Mohammad Mohammadi, Vahidreza Ghezavati
2013 International Journal of Industrial Engineering Computations  
Unlike the scenario based approaches, which use predefined scenarios to represent data uncertainty, in this paper, an interval approach is implemented to address data uncertainty for the part demands,  ...  In this paper, a new robust approach is presented to handle demand uncertainty in cell formation and layout design process.  ...  Kouvelis and Yu (1997) proposed a framework for robust discrete optimization, which seeks to find a solution, which minimizes the worst case performance under a set of scenarios for the data.  ... 
doi:10.5267/j.ijiec.2012.012.002 fatcat:ieyhujwp5va7hnw5eqhp4dvyfa
« Previous Showing results 1 — 15 out of 4,586 results