In this paper, we extend the classical Variable Size Bin Packing Problem (VS-BPP) by adding time features to both bins and items. Specifically, the bins act as machines that process the assigned batch of items with a fixed processing time. Hence, the items are available for processing at given times and are penalized for tardiness. Within this extension we also consider a stochastic variant, wh...

We consider the problem of scheduling a single machine to minimize total tardiness with sequence dependent setup times. We present two algorithms, a problem space-based local search heuristic and a Greedy Randomized Adaptive Search Procedure (GRASP) for this problem. With respect to GRASP, our main contributions are—a new cost function in the construction phase, a new variation of Variable Neig...

The authors argue that the primary purpose of dispatching tools is to allow trains to arrive on time rather than to minimize train delays in general and present a new methodological framework for the role of computer-aided train-dispatching ( AD) systems. One of the biggest obstacles ro ihe uccessful implemcntarion of an optimal CAD sy tern i the combinatorial nature of the optimal train-dispat...

This paper investigates thenotion of preemption in scheduling,with earliness and tardiness penalties. Starting from the observation that the classical cost model where penalties only depend on completion times does not capture the just-in-time philosophy, we introduce a new model where the earliness costs depend on the start times of the jobs. To solve this problem, we propose an efficient repr...

In this paper, we investigate the performance of different dispatching and scheduling heuristics for batching tools in a semiconductor wafer fabrication facility (wafer fab) by means of discrete event simulation. Because the processing times of lots on batching tools are quite large compared to those of other processes, careful batching decisions may have a great impact on the performance of th...

We consider the scheduling problem of setting the upper bounds for the actual processing times and maintenance times under assumption that the actual processing times of a job is a position-dependent power function. The maintenance duration is a position-dependent exponential function. Through building a corresponding jobs scheduling model, we found the scheduling problem can be transformed as ...

In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in ¯exible manufacturing systems. The PSGA is used to generate approximately ef®cient solutions minimizing both the manufacturing cost and total weighted tardiness. This is the ®rst implementation of PSGA to solve a multiobjective optimization problem (MOP)....

In many real-world production systems, it requires an explicit consideration of sequencedependent setup times when scheduling jobs. As for the scheduling criterion, the tardiness, holding and setup costs are always regarded as the most important criteria in practical systems. Considering all of these criterions has received little attention in the scheduling literature. In this paper, we presen...

We treat the problem of optimally allocating resources of limited availability to activities in a project when the objective function is composed of the cost of the resources utilization and a penalty for tardiness. Our model derives from consideration of activities’ work content rather than duration, as is traditionally done in other studies. In this report we assume that the work content is k...