A single machine scheduling with generalized and periodic due dates to minimize total deviation

BC Choi, KM Kim, Y Min, MJ Park - Discrete Applied Mathematics, 2022 - Elsevier
We consider a single-machine scheduling problem such that the due date is assigned not to
a specific job, but to a job position, with identical intervals between consecutive due dates …

Implementing Network Transformation Based Algorithms for a Special Case of Scheduling Jobs with Periodic Due Dates on Parallel Machines

K Toyoda, Y Karuno - 2024 Joint 13th International Conference …, 2024 - ieeexplore.ieee.org
In this paper, we revisit a scheduling problem of just-in-time jobs with periodic due dates on
parallel identical machines with multiple service slots, and address a novel imple-mentation …

A heuristic algorithm for one-machine just-in-time scheduling problem with periodic time slots

E Chiba, K Hiraishi - IEICE TRANSACTIONS on Fundamentals of …, 2005 - search.ieice.org
Just-in-time scheduling problem is the problem of finding an optimal schedule such that
each job finishes exactly at its due date. We study the problem under a realistic assumption …

Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines

D Dereniowski, W Kubiak - Journal of Scheduling, 2010 - Springer
The paper addresses the problem of multi-slot just-in-time scheduling. Unlike the existing
literature on this subject, it studies a more general criterion—the minimization of the …

Maximizing the total weight value of just-in-time jobs in identical parallel machines with periodic time slots

E Chiba, T Kageyama, Y Karuno… - 2012 IEEE International …, 2012 - ieeexplore.ieee.org
We address the processing of jobs in an environment with periodic due dates. Every job
must be completed exactly on a due date, the situation of which shall be referred to as just-in …

Maximizing the total weight of just-in-time jobs under multi-slot conditions is NP-hard

E Chiba, S Imahori - IEICE TRANSACTIONS on Information and …, 2016 - search.ieice.org
A job is called just-in-time if it is completed exactly on its due date. Under multi-slot
conditions, each job has one due date per time slot and has to be completed just-in-time on …

Algorithm for multislot just-in-time scheduling on identical parallel machines

SC Sung, O Cepek, K Hiraishi - … International Conference on …, 2007 - ieeexplore.ieee.org
Multislot just-in time scheduling deals with processing a set of jobs in an environment with
cyclically repeating due dates. Every job must be completed exactly at one of its due dates …

[PDF][PDF] Algorithm for multislot just-in-time scheduling

SC Sung, O Cepek, K Hiraishi - ISME'07: international symposium …, 2007 - researchgate.net
Multislot just-in time scheduling deals with processing a set of jobs in an environment with
cyclically repeating due dates, where the length of the period between two consecutive due …

A heuristic algorithm for maximizing the total weight of just-in-time jobs under multi-slot conditions

R Saito, E Chiba - 2016 IEEE International Conference on …, 2016 - ieeexplore.ieee.org
Maximizing the total weight of just-in-time jobs under multi-slot conditions was proven
recently to be NP-hard. We consider a heuristic algorithm for this problem. First, we compute …

Research on just-in-time scheduling

Y Endo, K Watanabe, E Chiba… - 2012 Proceedings of …, 2012 - ieeexplore.ieee.org
The aim of this paper is to research an existing just-in-time scheduling problems. Moreover,
we propose a new algorithm for a just-in-time scheduling problem, and perform a …