Search
Now showing items 1-2 of 2
New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers
(
Taylor and Francis Ltd.
, 2019 , Article)
The two-machine flowshop problem with unlimited buffers with the objective of minimising the makespan (F2||Cmax) is addressed. Johnson’s algorithm finds optimal solutions (permutations) to this problem, but are not necessarily ...
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
(
Hindawi Limited
, 2016 , Article)
The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal ...