This work addresses the minimization of the makespan criterion for the flowshop scheduling problem with blocking. In this environment there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. We propose a lower bound which exploits the occurrence of blocking. A branch-and-bound algorithm that uses...

This paper reports on computational experiments involving optimal solutions to the flowshop tardiness problem. Of primary interest was a generic approach: solutions were obtained using a spreadsheet-based, mixed-integer programming code. However, the results compare favorably with those from a specially-tailored branch and bound algorithm. The main implication is that hardware and software have...

This paper addresses the minimization of the mean absolute deviation from a common due date in a two-machine flowshop scheduling problem. Initially, a job scheduling algorithm that obtains an optimal schedule for a given job sequence is presented. This algorithm is used with a job insertion procedure to generate a group of heuristics that differ on the initial job sequencing rule. Computational...

This paper presents an approach for finding an optimal schedule of n-jobs and m-machines flowshop scheduling problem involving transportation time between jobs by using neural networks. An algorithm has been given for finding the optimal sequence in scheduling problem without transportation time [2]. Here, this algorithm is applied when transportation times are involved between machines to find...

ABSTRACT During the shipbuilding process, a block assembly line suffers bottleneck when largest amount of material is processed. Therefore, scheduling optimization important for productivity. Currently, sequence inbound products controlled by determining input using heuristic or metaheuristic approach. However, algorithm has limitations in that computation time increases exponentially as number...

Multi-objective evolutionary algorithms (MOEAs) have been the subject of a large research effort over the past two decades. Traditionally, these MOEAs have been seen as monolithic units, and their study was focused on comparing them as blackboxes. More recently, a component-wise view of MOEAs has emerged, with flexible frameworks combining algorithmic components from different MOEAs. The number...