The AMP-AKZO Riverhead Circuits Division is responsible for manufacturing printed circuit boards. Scheduling problems have resulted from both physical and operating constraints. The AMP-AKZO PROVISA Scheduling System ( A P S S ) was developed to better manage order due-date and plant throughput performance. The fully integrated system is made up of the Production Control Inventory System (PCIS)...

This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line scheduling policies for linearly increasing speed functions. We then explain the computational/numerical issues involved in implementing this policy. We next explore the online setting, showing that there exist adversa...

despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. this paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (mip) models to solve thisproblem. these models have been formulated for the classical single machine problem, namely sequ...

tics with the same consistency techniques (Nuijten, 1994). In this paper we re-evaluate texture-based heuristics in light of recent advances in scheduling technology and show that on two job shop scheduling problem sets (a widely used set of Operations Research benchmark problems and a set of randomly generated, hard problems) a texture-based heuristic outperforms heuristic commitment technique...

Project preemption allows resources flow passively from one project or task to another. Due to high-cost and high-risk characteristics of software development, project preemption might have a significant impact on the ultimate completion time of a software project. This article examines the feasibility of the Taguchi’s parameter design to achieve robust resource assignment for multiple software...

We study the early work scheduling problem on identical parallel machines in order to maximize total work, i.e., parts of non-preemptive jobs that are executed before a common due date. By preprocessing and constructing an auxiliary instance which has several good properties, for any desired accuracy $$\varepsilon $$ , we propose efficient polynomial time approximation scheme with running $$O\l...