Filters








2,611 Hits in 6.6 sec

Multi-criteria blocking flow shop scheduling problems: Formulation and performance analysis

G. Lebbar, I. El Abbassi, A. Jabri, A. El Barkany, M. Darcherif
2018 Advances in Production Engineering & Management  
This paper deals with multi machines permutation flow shop scheduling with limited buffers capacity and different release dates of jobs, where the performance is measured by the minimization of the weighted  ...  Thereafter, using CPLEX software, we generate a set of tests in an endeavor to examine formulation for dissimilar size problems in terms of optimality solution and computational CPU time complexity.  ...  An empirical analysis of heuristics for solving the two-machine flow Yandra, Tamura, H. (2007).  ... 
doi:10.14743/apem2018.2.279 fatcat:oroltsndeza35lasr6qdhl3vyy

Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

Lotfi Hidri, Anis Gharbi, Mohamed Aly Louly
2014 The Scientific World Journal  
We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times.  ...  These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases.  ...  Acknowledgment The authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for its funding of this research through the Research Group Project  ... 
doi:10.1155/2014/605198 pmid:25610911 pmcid:PMC4281465 fatcat:zbt3ajtxd5egphwpdwrfrbzfeq

Page 72 of The Journal of the Operational Research Society Vol. 58, Issue 1 [page]

2007 The Journal of the Operational Research Society  
Complexity of machine scheduling problems. Ann Dis Math 1: 343-362. Potts CN (1985). Analysis of heuristics for two-machine flow shop sequencing subject to release dates. Math Opns Res 10: 577-584.  ...  Fast algorithms to minimize the makespan or maximum lateness in two-machine flow shop with release times. J Sch 5: 71-92. Gharbi A and Haouari M (2002).  ... 

Page 5317 of Mathematical Reviews Vol. , Issue 87i [page]

1987 Mathematical Reviews  
This approach should help the reader to handle flow shop models that involve release times, sep- arated transfer lags and/or other job-related parameters.  ...  They solved the problem of scheduling n jobs being pro- cessed on the machines M,; and Mg in the same order M,, M2 to minimize completion time.  ... 

Minimizing maximum lateness in a flow shop subject to release dates

M Haouari, T Ladhari
2007 Journal of the Operational Research Society  
of the two-machine flow shop problem with time lags, ready times, and delivery times.  ...  Complexity of machine scheduling problems. Ann Dis Math 1: 343-362. Potts CN (1985). Analysis of heuristics for two-machine flow shop sequencing subject to release dates. Math Opns Res 10: 577-584.  ... 
doi:10.1057/palgrave.jors.2602092 fatcat:r6ld6lmpurek5ebc7wbc5b5acq

A survey of case studies in production scheduling: Analysis and perspectives

Helio Yochihiro Fuchigami, Socorro Rangel
2018 Journal of Computational Science  
The problems of production scheduling and sequencing refer to decision making regarding the designation of jobs to available resources and their subsequent order to optimize pre-defined performance measures  ...  From the early days of research in this area until this last decade, the publication of case studies has been scarce, with their frequency only increasing very recently.  ...  The second author thanks the hospitality of the Universidad de Valladolid, Spain, where part of this work was conducted.  ... 
doi:10.1016/j.jocs.2017.06.004 fatcat:esjzovlebbembdh4rqln3ugbw4

Multi-objective permutation and non-permutation flow shop scheduling problems with no-wait: A systematic literature review

Harpreet Singh, Jaspreet Singh Oberoi, Doordarshi Singh
2020 Reserche operationelle  
Flow shop scheduling is a type of scheduling where sequence follows for each job on a set of machines for processing.  ...  The flexible flow shop scheduling problems with no-wait have mainly addressed for flow optimization on the shop floor in manufacturing, processing, and allied industries.  ...  TWO OR THREE-MACHINE NWFS PROBLEMS The two or three-machine minimum makespan flow shop with the no-wait in the process is NP-hard.  ... 
doi:10.1051/ro/2020055 fatcat:t3g52lg2jzghfcljyig6ruu25a

A survey of scheduling problems with setup times or costs

Ali Allahverdi, C.T. Ng, T.C.E. Cheng, Mikhail Y. Kovalyov
2008 European Journal of Operational Research  
Allahverdi and Al-Anzi (2002) showed that the MDO scheduling problem for WWW applications can be modeled as a two-machine flow shop scheduling problem with separate setup times. • Kim et al. (2002) considered  ...  It further categorizes the literature according to shop environments, including single-machine, parallel machines, flow shop, no-wait flow shop, flexible flow shop, job shop, open shop, and others.  ...  They reduced the problem to the Gilmore-Gomory traveling salesman problem and solved it in polynomial time.5.1.3 Flexible (Hybrid) Flow ShopA flexible flow shop is an extension of a regular flow shop,  ... 
doi:10.1016/j.ejor.2006.06.060 fatcat:gaq5slhjsjfybjpx54qcveslme

The just-in-time scheduling problem in a flow-shop scheduling system

Dvir Shabtay
2012 European Journal of Operational Research  
In this paper, just-in-time (JIT) flow shop scheduling problem with preemption and machine idle time assumptions is considered in which objective function is minimizing the sum of weighted earliness and  ...  A new non-linear mathematical model is formulated for this problem and due to high complexity of the problem meta-heuristic approaches have been applied to solve the problem for finding optimal solution  ...  Also Shabtay et al (2012) gave an analysis for two-machine flow-shop problem with two criteria including weighted number of JIT jobs and total resource consumption cost.  ... 
doi:10.1016/j.ejor.2011.07.053 fatcat:pxgv7pokpbcujegkqoijrxekp4

Minimising makespan in the two-machine flow-shop with release times

R Tadei, J N D Gupta, F Della Croce, M Cortesi
1998 Journal of the Operational Research Society  
R Tadei et aL-Scheduling with release times 85 Potts CN (1985). Analysis of heuristics for two-machine flow- shop sequencing subject to release dates. Math Opns Res 10: 576-584. Hall LA (1994).  ...  ., Politecnico di Torino, Italy; and *Ball State University, USA This paper considers the two-machine flow-shop problem with the objective of minimising the makespan subject to different release times.  ... 
doi:10.1038/sj.jors.2600481 fatcat:wljycvyljbes5cfbv6h4tm6eka

Minimising makespan in the two-machine flow-shop with release times

R Tadei, J N D Gupta, F Della Croce, M Cortesi
1998 Journal of the Operational Research Society  
R Tadei et aL-Scheduling with release times 85 Potts CN (1985). Analysis of heuristics for two-machine flow- shop sequencing subject to release dates. Math Opns Res 10: 576-584. Hall LA (1994).  ...  ., Politecnico di Torino, Italy; and *Ball State University, USA This paper considers the two-machine flow-shop problem with the objective of minimising the makespan subject to different release times.  ... 
doi:10.1057/palgrave.jors.2600481 fatcat:kd2s4hyc6bekdhpxqjphgwzzjq

An efficient genetic algorithm for a hybrid flow shop scheduling problem with time lags and sequence-dependent setup time

Mohammad Farahmand-Mehr, Parviz Fattahi, Mohammad Kazemi, Hassan Zarei, Ali Piri
2014 Manufacturing Review  
In this paper, a hybrid flow shop scheduling problem with a new approach considering time lags and sequence-dependent setup time in realistic situations is presented.  ...  Computational results indicate that the designed GA can produce near optimal solutions in a short computational time for different size problems.  ...  Kurz and Askin [9] studied the SDST flexible flow shop problem with missing operations, where the machine routes for some jobs contain less than m machines, i.e., all the jobs need not visit all the  ... 
doi:10.1051/mfreview/2014020 fatcat:ovs26ckeezcz3idoqd6utfsofu

Minimising maximum lateness in a two-machine flowshop

M Haouari, T Ladhari
2000 Journal of the Operational Research Society  
Analysis of heuristics for two-machine flow shop sequencing subject to release dates. Math Opns Res 10: 577-584. Hall LA (1994).  ...  Minimising makespan in the two-machine flow-shop with release times. J Opl Res Soc 49: 77-85. Sen T and Raiszadeh FME (1996).  ... 
doi:10.1057/palgrave.jors.2600065 fatcat:kh2l3s62ofejhnr6vcg6iujv4a

Rule based heuristic approach for minimizing total flow time in permutation flow shop scheduling

Balasundaram Rathinam
2015 Tehnički Vjesnik  
Since this problem is known to be strongly NP-hard, this work proposes heuristic based methodology to solve it.  ...  The advantages of DT's are that the dispatching rule is in the form of If-then else rules which are easily understandable by the shop floor people.  ...  [12] introduced optimal schedule block and polynomial time dynamic programming algorithm to solve total completion time in two machine flow shop scheduling problem with fixed job seqence.  ... 
doi:10.17559/tv-20130704132725 fatcat:53encmt62rf27od7a7meohqo64

Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity

C. N. Potts, L. N. Van Wassenhove
1992 Journal of the Operational Research Society  
In many practical situations, batching of similar jobs to avoid set-ups is performed whilst constructing a schedule. On the other hand, each job may consist of many identical items.  ...  Some important open problems for which further research is required are also highlighted.  ...  Finally, for two machines, maximum completion time problems for the flow-shop F21 IC,. and open-shop 021 ICinax are solved by algorithms of Johnson9 and Gonzales and Salmi l° respectively.  ... 
doi:10.2307/2583559 fatcat:4zax7vq4svhjbgqfytaoa5oxca
« Previous Showing results 1 — 15 out of 2,611 results