We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm. KeywordsEarliness-tardiness scheduling, Polyn...

This paper considers the bicriteria scheduling problem of simultaneously minimizing makespan (Cmax) and maximum tardiness (Tmax) on a single machine with release dates. The problem is, by nature, NP-Hard. Therefore, one approximation algorithm (labeled as CTA1) was proposed for solving this problem. The CTA1 algorithm was compared with the Branch and Bounds (BB) procedure specifically implement...

Total weighted tardiness is a measure of customer satisfaction. Minimizing it represents satisfying the general requirement of on-time delivery. In this research, we consider an ant colony optimization (ACO) algorithm to solve the problem of scheduling unrelated parallel machines to minimize total weighted tardiness. The problem is NP-hard in the strong sense. Computational results show that th...

In the paper, we investigate two single processor problems, which deal with the process of negotiation between a producer and a customer about delivery time of final products. This process is modelled by a due interval, which is a generalization of well known classical due date and describes a time interval, in which a job should be finished. In this paper we consider two different mathematical...

Nowadays many industry consider an interval time as a due date instead of precise points in time. In this study, the hybrid flow shop scheduling problem with basic blocking constraint is tackled. Where jobs, if done within window, are deemed on Therefore, criterion to minimize sum weighted earliness and tardiness. This variant flowshop not investigated best our knowledge. we introduced new meta...

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

We address the no-wait k-stage flexible flowshop scheduling problem where there are m identical machines at each stage. The objectives are to schedule the available n jobs so that makespan and mean tardiness of n jobs are minimized. Sequence-dependent setup times are treated in this problem as one of the prominent practical assumptions. This problem is NP-hard, and therefore we present a new mu...

<p style='text-indent:20px;'>This paper studies the problem of scheduling <inline-formula><tex-math id="M1">\begin{document}$ n $\end{document}</tex-math></inline-formula> jobs with equal processing times on id="M2">\begin{document}$ m uniform machines to optimize two criteria simultaneously. The main contribution is an id="M3">\begin{document}$ O(n\log m+n^3...

this paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. the objective is to minimize the weighted sum of makespan and maximum tardiness. three meta-heuristic methods based on genetic algorithm (ga), imperialist competitive algorithm (ica) and a hybrid approach of ga a...