In this paper, the problem of determining the best schedule for a set of projects has been modeled in the form of a generalized tardiness flowshop (GTF) problem. We develop a set of heuristic algorithms for minimizing the total tardiness of jobs in a GTF problem. In the generalized version of tardiness flowshop problems, a job is considered to be a collection of operations and there is a due da...

In this paper, a multi objective model in which operation planning and tool assignment flexible manufacturing system (FMS) has been considered simultaneously. regard, the main characteristics of FMS have analyzed. Then, comprehensive model, including major parameters cost components designed presented. The proposed contains factors machining cost, earliness tardiness penalties, part movement or...

We study multitasking scheduling and due-window assignment problems in a single machine, which can be found various application domains. In environment, unfinished job always interrupts in-processing job. common due window assignment, the aim is to find optimal minimise value of earliness tardiness penalty. this paper, we two problems, where objective first problem earliness, tardiness, startin...

This paper considers the SLK/DIF due window assignment problems on a single machine with general job-dependent positional effect, where actual processing time of job is subject to and effect. Production schedulers may decide outsource/reject some jobs by paying corresponding costs. Based whether accept tardiness jobs, we consider two different objectives under slack assignment, respectively. Th...

This study proposes an exact algorithm for the precedence-constrained singlemachine scheduling problem to minimize total job completion cost where machine idle time is forbidden. The proposed algorithm is an extension of the authors’ previous algorithms for the problem without precedence-constraints and is based on the SSDP (Successive Sublimation Dynamic Programming) method. Numerical experime...

Prior work has provided bounds on the deadline tardiness that a set of sporadic real-time tasks may incur when scheduled using the global earliest-deadline-first (G-EDF) scheduling algorithm. Under the sporadic task model, it is necessary that no individual task overutilize a single processor and that the set of all tasks does not overutilize the set of all processors. In this work we generaliz...

The Apparent Tardiness Cost (ATC) heuristic is one of the best performing dispatch rules for the weighted tardiness scheduling problem. This heuristic uses a lookahead parameter whose value must be specified. In this paper we develop a function that maps some instance statistics into an appropriate value for the lookahead parameter. This function is compared with some fixed values that have bee...

The purpose of this study is to propose a new branch-and-bound algorithm for a class of scheduling problems to minimize total tardiness on identical parallel machines. In this algorithm, Lagrangian decomposition is applied to obtain better lower bounds. In addition, the job dominance conditions for the single machine tardiness problem are utilized for both restricting branches and improving the...