Now showing items 1-2 of 2
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics [Article]
In this paper, we address the problem of scheduling a set of jobs in a flowshop with makespan objective. In contrast to the usual assumption of machine availability presented in most research, we consider that machines may ...
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach [Article]
In this paper we study a due date setting problem in a flowshop layout. The problem consists of scheduling a set of jobs arriving to the system together with jobs already present (denoted as old jobs), in order to set a ...