The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The Journal of the Operational Research Society
The branch-and-bound algorithm presented in this paper is used to guide a genetic algorithm in its search for optimal solutions. ... Kyparisis (1987) Single machine scheduling research. Omega 15, 207-227. . T. D. Fry, R. D. Armstronc and H. Lewis (1979) A framework for single machine multiple objective sequencing research. ...
The primary reason for developing the branch-and-bound approach is that its results can be used to guide other heuristic techniques, such as simulated annealing, tabu search and genetic algorithms, in ... In fact, it is able to produce optimal schedules for 500-job problems in which the second machine dominates the first machine. ...doi:10.2307/2584309 fatcat:6pesyp6cz5fwhp3sitzluoxuhm
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. ... Most of the prior investigations related to production scheduling problems have solely focused on the optimization of an individual criterion under a single constraint; nevertheless, this is most of the ... A decomposition algorithm for the single machine total tardiness problem, Operations Research Letters, Vol. 1, No. 5, 177-181, doi: 10.1016/0167-6377(82)90035-9.  Parsamanesh, A.H., Sahraeian, R. ( ...doi:10.14743/apem2018.2.279 fatcat:oroltsndeza35lasr6qdhl3vyy
Genetic algo- rithms for the two-stage bicriteria flowshop problem. Eur J Op! Res 95: 356-373. Rajendran C (1992). Two-stage flowshop scheduling problem with bicriteria. J Op! Res Soc 43: 871-884. ... An efficient branch-and-bound algorithm for the two-machine bicriteria fiowshop scheduling problem. J Manuf Systems 20: 113-123. Chakravarthy K and Rajendran C (1999). ...doi:10.1057/palgrave.jors.2601403 fatcat:l6foqwa7irhy3aulqzlcpufqde
Given that the problem is NP-hard, we propose an iterative SPT-LPT-SPT heuristic and a bicriteria genetic algorithm for the problem. ... We consider bicriteria scheduling on identical parallel machines in a nontraditional context: jobs belong to two disjoint sets, and each set has a different criterion to be minimized. ... We also propose a bicriteria genetic algorithm to solve the problem. ...doi:10.1016/j.ejor.2008.10.038 fatcat:3jhvm4lb65hhpe7gjutjku6h4y
The results of the reviewing and analysis of 46 papers showed opportunities for future research on this topic, including the following: (i) use uniform and dedicated parallel machines, (ii) use exact and ... This research focuses on the Hybrid Flow Shop production scheduling problem, which is one of the most difficult problems to solve. ... MULTICRITERIA HYBRID FLOW SHOP SCHEDULING PROBLEM: LITERATURE REVIEW A literature review on the development of solution methods for the bicriteria, and multicriteria scheduling problem was presented ...doi:10.14807/ijmp.v5i4.242 fatcat:hpnypjad65dylcdaoat72my4ju
A primary reason for developing it is to use its results to guide a genetic algorithm. ... The branch-and-bound algorithm presented in this paper is used to guide a genetic algorithm in its search for optimal solutions. ...doi:10.1057/jors.1995.102 fatcat:ycgwrys26fefjob5j2yjg7ovhi
We investigate its performance on a specific bi-criteria scheduling problem, minimizing total flowtime and maximum earliness on a single machine. ... The intent of this research is to investigate methods to use genetic algorithms to find the set of efficient solutions to a bi-criteria problem. ... In Section 4, we describe a bi-criteria single machine scheduling problem and the problem specific decisions for BRKGA, as well as a heuristic for the problem from the literature. ...doi:10.1145/1068009.1068144 dblp:conf/gecco/KurzC05 fatcat:5jnkdrzvcbhrbftxeelwofucfi
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. ... The other two are metaheuristic approaches using a genetic algorithm and tabu-search. ... Acknowledgements The authors thank Süleyman Kardas ß and Mustafa Aydogdu for their assistance in obtaining the numerical results for the genetic algorithm and the tabu-search applications in this paper ...doi:10.1016/j.ejor.2009.02.014 fatcat:7tb7fb5vfjhsxa4iqulp2zcp6a
We propose a hy- brid simulated annealing and a hybrid genetic heuristics, which can be used for the single criterion of makespan or maximum lateness, or the bicriteria problem. ... There are many heuristics for the single criterion of makespan. However, no heuristic has been reported in the literature on the single criterion of maximum lateness or the bicriteria problem. ...
This paper attempts to solve a two-machine¯owshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total¯ow time and makespan ... Experimental results show that the proposed heuristic algorithm can solve this problem rapidly and accurately. ... study solves the two-machine¯owshop bicriteria scheduling problem with release dates for the jobs. ...doi:10.1016/s0360-8352(99)00149-7 fatcat:gb3ufaq66jhrlddzx26qsz7uaq
A few papers were published in the 1980s for single-machine multi-objective scheduling problems. ... Problem setting Consider the flowshop scheduling problem with 7 jobs available for processing at time ¢=0 and requiring a single operation on each of m ordered and continuously available machines. ...doi:10.1057/palgrave.jors.2601746 fatcat:rfcjrodwwfdmbjk77xgh5ymdfa
In this work we study a flowshop scheduling problem in which jobs are not allowed to wait in-between machines, a situation commonly referred to as no-wait. ... The local search methods are based on genetic algorithms and iterated greedy procedures. ... Heuristic and local search methods Heuristic methods Among the most widely used heuristic algorithms for due date based scheduling problems are dispatching rules. ...doi:10.1080/00207540802070942 fatcat:27r2feqgozg7bbywls6pf37bvu
This paper discusses the more recent literature on scheduling using multi criteria decision making (MCDM). This article addresses both job-shop and flow-shop scheduling problem. ... Scheduling is widely studied and complex combinatorial optimization problems. A vast amount of research has been performed in this particular area to effectively schedule jobs for various objectives. ... In Neppalli et al. 16 two genetic algorithms were proposed for solving the two machine bicriteria flow-shop problem also in a lexicographical way as in Rajendran 14 . ...doi:10.3329/jme.v41i2.7508 fatcat:jtdncw2ldjbrxo3tf4w2ve2wny
In this paper, a novel approach using an efficient multi-objective genetic algorithm EMOGA is proposed to solve the problems of production planning of flexible manufacturing systems (FMSs) having four ... EMOGA makes use of Pareto dominance relationship to solve the problems without using relative preferences of multiple objectives. ... Swarnkar and Tiwari  aggregated two objective functions of a bicriteria machine loading problem into a single function and employed a hybrid algorithm based on tabu search and simulated annealing to ...doi:10.1016/j.ijmachtools.2004.10.010 fatcat:xppxjmur7bb7tj2pdru4ffrdoi
« Previous Showing results 1 — 15 out of 163 results