Consider an arbitrary schedule for a single machine scheduling problem.
We consider the following machine scheduling game.
In production scheduling, many popular problems have been investigated intensively such as single machine scheduling, parallel machine scheduling, (flexible) flow shop scheduling, (flexible) job shop scheduling, and open shops.
The job shop scheduling problem (JSP) [90], the test task scheduling problem (TTSP) [52], the parallel machine scheduling problem (PMSP) [91] are typical representatives of the scheduling problem.
Numerical computational results focusing on the identical parallel machine scheduling problem and the general parallel machine scheduling problem shows that these algorithms outperform heuristic procedures, and fit for larger scale parallel machine earliness/tardiness scheduling problem.
The proposed algorithm solves the single machine scheduling problems with earliness/tardiness cost in a just-in-time scheduling environment.
The problem of parallel machine scheduling for minimizing the makespan is an open scheduling problem with extensive practical relevance.
This paper considered the cash management in single machine scheduling for manufacturing industries.
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance.
(2016) studied the just in time single machine scheduling problem with a periodic preventive maintenance.
