This paper investigates an unrelated parallel machine scheduling problem with a restrictive common due date. The objective is to minimize the total sum of earliness/tardiness costs. Using some properties such as V-Shaped property, optimizing start times machines, and no idle time between successive jobs, we propose effective construction-based heuristics local search algorithms for problem. var...

The problem of scheduling n jobs with a large common due date on a single machine is addressed. The objective is to minimize the jobs’ total earliness and tardiness. In this paper, sequence-dependent setup times are considered, which makes the problem NP-Hard. Therefore, exact algorithms are very unlikely to optimally solve large problems within reasonable computational time. A Simulated Anneal...

In this paper, we propose a Pareto-based tabu search algorithm for multi-objective FJSP with Earliness/Tardiness (E/T) penalty. In the hybrid algorithm, several neighboring structure based approaches were proposed to improve the convergence capability of the algorithm while keep population diversity of the last Pareto archive set. In addition, an external Pareto archive was developed to record ...

The single machine scheduling problem with a common due date and nonidentical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performanc...

Mixed model two-sided assembly lines (MM2SAL) are applied to assemble large product models, which is produced in high-volume. So, the sequence planning of products to reduce cost and increase productivity in this kind of lines is imperative. The presented problem is tackled in two steps. In step 1, a framework is developed to select and prioritize customer orders under the finite capacity of th...

Abstract: Research on due date oriented objectives in the parallel machine environment is at best scarce compared to objectives such as minimizing the makespan or the completion time related performance measures. Moreover, almost all existing work in this area is focused on the identical parallel machine environment. In this study, we leverage on our previous work on the single machine total we...

A single machine scheduling problem is described which covers earliness costs, tardiness costs and setup costs. Setups are needed whenever a switch is made to a job of another product family. All jobs within the same product family have the same processing time. Besides setup costs also setup times are involved. Idle time is allowed, preemption is not allowed. Both a mixed integer programming f...