Optimally rescheduling jobs with a LIFO buffer

06/30/2021
by   Gaia Nicosia, et al.
0

This paper considers single-machine scheduling problems in which a given solution, i.e. an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g. due to changes in the job data or because of the local objective in a stage of a supply chain that is not aligned with the given sequence. A common production setting entails the movement of jobs (or parts) on a conveyor. This is reflected in our model by facilitating the re-sequencing of jobs via a buffer of limited capacity accessible by a LIFO policy. We consider the classical objective functions of total weighted completion time, maximum lateness and (weighted) number of late jobs and study their complexity. For three of these problems we present strictly polynomial-time dynamic programming algorithms, while for the case of minimizing the weighted number of late jobs NP-hardness is proven and a pseudo-polynomial algorithm is given.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/30/2018

Optimal Algorithms for Scheduling under Time-of-Use Tariffs

We consider a natural generalization of classical scheduling problems in...
09/18/2017

New Algorithms for Minimizing the Weighted Number of Tardy Jobs On a Single Machine

In this paper we study the classical single machine scheduling problem w...
11/10/2017

Scheduling with regular performance measures and optional job rejection on a single machine

We address single machine problems with optional job rejection, studied ...
03/03/2018

A Swift Heuristic Method for Work Order Scheduling under the Skilled-Workforce Constraint

The considered problem is how to optimally allocate a set of jobs to tec...
02/28/2018

An Approximate Pareto Set for Minimizing the Maximum Lateness and Makespan on Parallel Machines

We consider the two-parallel machines scheduling problem, with the aim o...
05/06/2019

Non-clairvoyant Precedence Constrained Scheduling

We consider the online problem of scheduling jobs on identical machines,...
10/05/2021

Phoebe: A Learning-based Checkpoint Optimizer

Easy-to-use programming interfaces paired with cloud-scale processing en...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.