In many manufacturing systems, jobs that are completed early are held as finished-goods inventory until their due-dates, and hence we incur earliness costs. Similarly, jobs that are completed after their due-dates incur penalty. The objective in such situations would, therefore, be to meet the due-dates of the respective jobs as closely as possible, and consequently minimize the sum of earlines...

Resource Cost Aware Scheduling Problems Rodrigo A. Carrasco Managing the consumption of non-renewable and/or limited resources has become an important issue in many different settings. In this dissertation we explore the topic of resource cost aware scheduling. Unlike the purely scheduling problems, in the resource cost aware setting we are not only interested in a scheduling performance metric...

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included i...

This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes (including weighted sum of earliness, tardiness, assignment, where weights are position-dependent) resource-allocation costs. Given some optimal properties...

This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...

Meeting due dates as a re ̄ ection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today’s manufacturing environments. The natural quanti ® cation of this qualitative goal involves tardiness related measures. In this study, we consider the dynamic job shop scheduling problem with the weighted tardiness criterion. After we present a comprehensive liter...

This paper considers a real-world industrial problem in order to minimize the (weighted) number of tardy jobs. This problem occurs in a company where due dates are associated with parts, and penalties incur when the parts are completed after the due dates, whatever the magnitude of the tardiness. Therefore, the objective function can be modelled as minimization of the (weighted) number of tardy...

This paper presents the fuzzy mixed-integer goal programming model for a single machine scheduling problem with bi-objectives consisting of the minimization of the total weighted flow time and total weighted tardiness. This model is solved by a fuzzy goal programming approach to verify and validate the proposed approach for the above problem. Two test problems in small and large sizes are gener...

This paper considers a real-world industrial problem in order to minimize the (weighted) number of tardy jobs. This problem occurs in a company where due dates are associated with parts, and penalties incur when the parts are completed after the due dates, whatever the magnitude of the tardiness. Therefore, the objective function can be modelled as minimization of the (weighted) number of tardy...

In this paper, we study the job shop scheduling problem with the objective of minimizing the total weighted tardiness. We propose a hybrid shifting bottleneck tabu search (SB-TS) algorithm by replacing the reoptimization step in the shifting bottleneck (SB) algorithm by a tabu search (TS). In terms of the shifting bottleneck heuristic, the proposed tabu search optimizes the total weighted tardi...