this paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. the fuzzy set theory is applied to describe this situation. a novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. due to the computational complexities, the prop...

The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...

In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...

In this paper, a scheduling problem for multiple automated guided vehicles (AGVs) in a manufacturing system is proposed and formulated. Considering the due date of AGVs requiring for material handling among shops in a jobshop layout, their earliness and tardiness are significant in satisfying the expected cycle time and from an economic view point. Earliness results in AGVs waiting and tardines...

We study the earliness-tardiness scheduling problem on a single machine with due date assignment and controllable processing times. We analyze the problem with three different due date assignment methods and two different processing time functions. For each combination of these, we provide a polynomialtime algorithm to find the optimal job sequence, due date values and resource allocation minim...

This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...

This paper considers the problem of scheduling a given number of jobs on a single machine to minimize total earliness and tardiness when family setup times exist. The paper proposes optimal branch-and-bound algorithms for both the group technology assumption and if the group technology assumption is removed. A heuristic algorithm is proposed to solve larger problems with the group technology as...