Now showing items 1-5 of 5
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 ...
Using real-time information to reschedule jobs in a flowshop with variable processing times [Article]
In a time where detailed, instantaneous and accurate information on shop-floor status is becoming available in many manufacturing companies due to Information Technologies initiatives such as Smart Factory or Industry 4.0, ...
Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling [Article]
This paper focuses on two components of idle time and waiting time, namely core idle time, ∑CITi, and core waiting time, ∑CWTj. Both measures are relevant indicators of the efficiency of production systems, since they are ...
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 ...
The distributed permutation flow shop to minimise the total flowtime [Article]
(Elsevier Ltd, 2018-04)
In the last years, researchers are paying special attention to scheduling in distributed environments due to the increasing benefits of multi-factory manufacture. In this paper, we address the distributed permutation ...