The single machine early/tardy problem
Management Science
Sequencing with earliness and tardiness penalties: a review
Operations Research
A survey of results for sequencing problems with controllable processing times
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
A composite heuristic for the single machine early/tardy job scheduling problem
Computers and Operations Research
The One-Machine Problem with Earliness and Tardiness Penalties
Journal of Scheduling
Improved heuristics for the early/tardy scheduling problem with no idle time
Computers and Operations Research
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
An exact approach to early/tardy scheduling with release dates
Computers and Operations Research
Scheduling parallel CNC machines with time/cost trade-off considerations
Computers and Operations Research
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Preemption in single machine earliness/tardiness scheduling
Journal of Scheduling
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
Journal of Scheduling
Computers and Operations Research
Computers and Industrial Engineering
Minimizing total tardiness on a single machine with controllable processing times
Computers and Operations Research
Single machine scheduling with discretely controllable processing times
Operations Research Letters
Hi-index | 0.00 |
In most deterministic scheduling problems job processing times are considered as invariable and known in advance. Single machine scheduling problem with controllable processing times with no inserted idle time is presented in this study. Job processing times are controllable to some extent that they can be reduced or increased, up to a certain limit, at a cost proportional to the reduction or increase. In this study, our objective is determining a set of compression/expansion of processing times in addition to a sequence of jobs simultaneously, so that total tardiness and earliness are minimized. A mathematical model is proposed firstly and afterward a net benefit compression-net benefit expansion (NBC-NBE) heuristic is presented so as to acquire a set of amounts of compression and expansion of jobs processing times in a given sequence. Three heuristic techniques in small problems and in medium-to-large instances two meta-heuristic approaches, as effective local search methods, as well as these heuristics are employed to solve test examples. The single machine total tardiness problem (SMTTP) is already NP-hard, so the considered problem is NP-hard obviously. The computational experiments demonstrate that our proposed heuristic is efficient approach for such just-in-time (JIT) problem, especially equipped with competent heuristics.