Scheduling linear deteriorating jobs with an availability constraint on a single machine

2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Single-machine scheduling with periodic maintenance to minimize makespan

2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe

Scheduling Jobs and a Variable Maintenance on a Single Machine with Common Due-Date Assignment

We investigate a common due-date assignment scheduling problem with a variable maintenance on a single machine. The goal is to minimize the total earliness, tardiness, and due-date cost. We derive some properties on an optimal solution for our problem. For a special case with identical jobs we propose an optimal polynomial time algorithm followed by a numerical example

Single machine scheduling with release dates and job delivery to minimize the makespan

AbstractIn single machine scheduling with release dates and job delivery, jobs are processed on a single machine and then delivered by a capacitated vehicle to a single customer. Only one vehicle is employed to deliver these jobs. The vehicle can deliver at most c jobs at a shipment. The delivery completion time of a job is defined as the time at which the delivery batch containing the job is delivered to the customer and the vehicle returns to the machine. The objective is to minimize the makespan, i.e., the maximum delivery completion time of the jobs. When preemption is allowed to all jobs, we give a polynomial-time algorithm for this problem. When preemption is not allowed, we show that this problem is strongly NP-hard for each fixed c≥1. We also provide a 53-approximation algorithm for this problem, and the bound is tight

Scheduling model for systems with complex alternative behaviour

In this paper we propose a flexible model for scheduling problems, which allows the modeling of systems with complex alternative behaviour. This model could for example facilitate the step from process planning model to optimization model. We show how automatic constraint generation can be performed for both Constraint Programming and Mixed Integer Linear Programming (MILP) models. Also, for the MILP case, a new formulation for mutual exclusion of resources is proposed. This new formulation works well for proving optimality in systems with multiple capacity resources. Some benchmarks for such job shop scheduling problems as well as systems with a large number of alternatives are also presented

Single machine scheduling with periodic machine availability

In this paper we address the problem of scheduling jobs on a single machine with cyclical machine availability periods. In this problem, the scheduling horizon is composed of periods where the machine is available followed by other periods where no operation can be performed. In the literature, the problem is denoted as scheduling with periodic maintenance, as it is usually assumed that these unavailability periods are employed to perform maintenance activities. Another situation is the one inspiring our research, i.e. the need of completing manufacturing operations within a shift. More specifically, we focus the single machine scheduling problem with makespan objective subject to periodic machine availability. There are several contributions proposing approximate procedures due to the NP-hardness shown for the problem. However, we are not aware of a computational evaluation among these procedures. Furthermore, the problem is similar to the classical bin packing problem, so it is of interest to explore the relation between both problems. In this paper, we address these two issues, and propose new approximate solution procedures for the problem.Ministerio de Ciencia e Innovación DPI2016-80750-