HEURISTIC APPROACH FOR BICRITERIA IN TWO STAGE OPEN SHOP SCHEDULING PROBLEM (original) (raw)
Related papers
Two-machine open shop scheduling with secondary criteria
International Transactions in Operational Research, Vol. 10, 2003, 267 - 294, 2003
This paper considers two-machine open shop problems with secondary criteria where the primary criterion is the minimization of makespan and the secondary criterion is the minimization of the total flow time, total weighted flow time, or total weighted tardiness time. In view of the strongly NP-hard nature of these problems, two polynomially solvable special cases are given and constructive heuristic algorithms based on insertion techniques are developed. A strongly connected neighborhood structure is derived and used to develop effective iterative heuristic algorithms by incorporating iterative improvement, simulated annealing and multi-start procedures. The proposed insertion and iterative heuristic algorithms are empirically evaluated by solving problem instances with up to 80 jobs.
HEURISTIC APPROACH FOR BICRITERIA IN CONSTRAINED N X 2 FLOW SHOP SCHEDULING PROBLEM
A bicriteria in n-jobs, 2-machines flow shop scheduling to minimize the rental cost of the machines under a specific rental policy in which the processing time and independent setup time each associated with probabilities including break down interval and job block criteria is considered. Further the jobs are attached with weights to indicate their relative importance. In this paper, a new heuristic algorithm has been developed for minimizing the makespan as well as the rental cost of machines which is simple and straight forward. A computer programme followed by a numerical illustration is given to substantiate the algorithm.
Optimal Two Stage Open Shop Specially Structured Scheduling To Minimize The Rental Cost
2016
The present paper is an attempt to develop a heuristic algorithm for two machines specially structured open shop scheduling in which order of processing is not given (A → B or B → A). Further the processing time of jobs are associated with their probabilities under some well defined structural relationship to one another. The objective of the paper is to minimize the rental cost of machines under a specified rental policy. A numerical illustration is given to support the algorithm.
International Journal of Pure and Apllied Mathematics, 2013
The present paper considers a more practical problem of scheduling n jobs in a two machine specially structured open shop to minimize the rental cost. Further the processing time of jobs are associated with their respective probabilities including job block criteria. In most of literature the processing times are always considered to be random, but there are significant situations in which processing times are not merely random but bear a well defined structural relationship to one another. The objective of this paper is to minimize the rental cost of machines under a specified rental policy. A numerical illustration is given to support the algorithm.
Minimizing Rental Cost under Specified Rental Policy in Two Stage Open shop Scheduling Problem
International Journal of Engineering Sciences & Research Technology, 2013
This Paper is an attempt to study two stage open shop scheduling problem in which processing time of the jobs are given. The objective of the paper is to obtain an algorithm to minimize the rental cost of the machines in two stage open shop scheduling problem under specified rental policy. A numerical illustration is given to justify the proposed algorithm.
Industrial Engineering Letters, 2011
This paper is an attempt to obtains an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtain the minimum makespan for n jobs 2 machines flowshop problem in which the processing times and independent set up times are associated with probabilities including the job block concept. A heuristic approach method to find optimal or near optimal sequence has been discussed. The proposed method is very simple and easy to understand and also provide an important tool for the decision makers. A computer programme followed by a numerical illustration is give to clarify the algorithm.