Single machine flow-time scheduling with a single breakdown
Acta Informatica
Single machine flow-time scheduling with scheduled maintenance
Acta Informatica
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Single machine scheduling with maximum earliness and number tardy
Computers and Industrial Engineering - Special issue: Selected papers from the 25th international conference on computers & industrial engineering in New Orleans, Louisiana
A comparison of lower bounds for the single-machine early/tardy problem
Computers and Operations Research
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Computers and Operations Research
Computers and Operations Research
Computers and Industrial Engineering
A survey of scheduling with deterministic machine availability constraints
Computers and Industrial Engineering
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
Computers & Mathematics with Applications
| Hi-index | 0.09 |
In this paper the problem of minimizing maximum earliness on a single machine with an unavailability period (1,h"1@?E"m"a"x) and also the same problem with simultaneous minimization of the two criteria of maximum earliness and number of tardy jobs (1,h"1@?E"m"a"x,N"T) are studied. It is shown that the problem 1,h"1@?E"m"a"x is NP-hard. For this problem a branch and bound approach is proposed which is based on a binary search tree. Proposing a heuristic algorithm named MMST, lower bound and efficient dominance rules, results in some instances with up to 3000 jobs being solved. The purpose in the problem 1,h"1@?E"m"a"x,N"T is to find the set of efficient solutions, i.e. the Pareto frontier. For this reason, for each measure E"m"a"x and N"T at first changes domain are calculated. A heuristic algorithm named PH and a branch and bound approach are developed to solve the problem. Proposing a lower bound and some dominance rules resulted in 96.4% of instances being solved optimally which proves the efficiency of the proposed method.