This paper pertains to a two machine flowshop scheduling involving independent setup time, transportation time and job block criteria in fuzzy environment. Further, a single transporting agent which carries the jobs from one machine to another is also considered. The objective of the paper is to minimize the makespan, idle time of the machines whenever the processing time, setup time each are u...

We consider the makespan minimization parallel machine scheduling problemwhere each machine may be unavailable for a known time interval. For this problem, we investigate how the worst-case behavior of the longest processing timefirst algorithm (LPT) is affected by the availability ofmachines. In particular, for givenmmachines, we analyze the cases where arbitrary number, , ranging from one tom...

In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, existing makespan optimal SAT-based solvers for MAPF have been modified for the sum-of-costs objective. In this paper, we empirically compare the hardness of solving MAPF with SATbased and search-based solvers under the makespan and the sum-of-costs objectives in a number of domains. ...

Abstract We consider a variant of the NP-hard problem assigning jobs to machines minimize completion time last job. Usually, precedence constraints are given by partial order on set jobs, and each job requires all its predecessors be completed before it can start. In this paper, we different type relation that has not been discussed as extensively is called OR-precedence. for start, require at ...

This paper presents makespan algorithms and scheduling heuristic for an Internet-based collaborative design and manufacturing process using bottleneck approach. The collaborative manufacturing process resembles a permutation re-entrant flow shop environment with four machines executing the process routing of M1,M2,M3,M4,M3,M4 in which the combination of the last three processes of M4,M3,M4 has ...

Scheduling concerns the allocation of limited resources overtime to perform tasks fulfill certain criterion and optimize one or several objective functions. One most popular models in scheduling theory is that flow-shop scheduling. During last 40 years, permutation sequencing problem with makespan minimization has held attraction many researchers. This characterized as Fm/prmu/Cmax notation Gra...

We study envy-free mechanisms for assigning tasks to agents, where every task may take a different amount of time to perform by each agent, and the goal is to get all the tasks done as soon as possible (i.e., minimize the makespan). For indivisible tasks, we put forward an envy-free polynomial mechanism that approximates the minimal makespan to within a factor ofO(logm), wherem is the number of...

The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem (JSP), where each operation is allowed to be processed by any machine from a given set, rather than one specified machine. In this paper, two algorithm modules, namely hybrid harmony search (HHS) and large neighborhood search (LNS), are developed for the FJSP with makespan criterion....