In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. Each batch starts from the setup ...

Abstract: An inappropriate architecture can have a significant negative effect on the success of a scheduling project. In development it can delay the release date, impair testability, and increase the difficulty of software maintenance. The final product can be a very slow scheduler. Even worse, it can make a scheduling problem grow until it can no longer fit in the computer. This paper walks ...

Domain filtering is a powerful technique for reduction of the search space during solving combinatorial problems like scheduling. In this paper we present several filtering algorithms designed specifically for scheduling in batch processing environments with sequence dependent setup times. We extend two known algorithms, namely edge finding and not-first/not-last technique, and we present a new...

This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...

In this paper, we discuss scheduling problems in semiconductor manufacturing. Starting from describing the manufacturing process, we identify typical scheduling problems that can be found in semiconductor manufacturing systems. We describe batch scheduling problems, job shop scheduling problems, scheduling problems with secondary resources, multiple orders per job scheduling problems, and sched...

As the virtualization of resources becomes popular, the scheduling problem of batch jobs on virtual machines requires new approaches. The dynamic and sharing aspects of virtual machines introduce unique challenges and complexity for the scheduling problems of batch jobs. In this paper, we propose a new set of metrics, called potential capacity (PC) and equilibrium capacity (EC), of resources th...

In this paper, we examine the impact of scheduling policies on batch sizing decisions in a multi-item production system. We also investigate the joint effect of scheduling policies and batch sizing decisions on production lead times. In particular, we compare the performance of a first come-first-served (FCFS) policy with a group scheduling (GS) policy and study the effect of both on the optima...

Scheduling in a manufacturing system is currently a research hotspot. This paper proposes a flexible, single-operation, serial-batch scheduling problem with mold constraints that arise from injection molding production. In such a scheduling problem, three decision problems exist: product batch splitting, sequencing, and resource selection. A divide-and-conquer framework is introduced to solve t...

Abstract In the current work, a new precedence-based mixed integer linear programming (MILP) scheduling framework, based on a continuous-time representation, is developed for the scheduling in multi-stage batch plants. Advantages and special features of the proposed scheduling model are highlighted through several instances of two base case studies. Results are analyzed and further criticized t...