This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|∑Cj). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing with the latest MILP model for the proposed problem in the literature, the complexity size of the propos...

Abstract This paper addresses a multi-objective energy-efficient scheduling problem of the distributed permutation flowshop with sequence-dependent setup time and no-wait constraints (EEDNWFSP), which have important practical applications. Two objectives minimization both makespan total energy consumption (TEC) are considered simultaneously. To address this problem, new mixed-integer linear pro...

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to th...

Drone delivery is drawing increasing attention in last-mile delivery. Effective solution methods to solve decision-making problems arising drone allow run and assess systems. In this paper, we focus on systems with a single traditional vehicle multiple drones working tandem fulfill customer requests. We address the Traveling Salesman Problem Multiple Drones (TSP-MD) investigate modeling challen...

The main objective of the working paper series of the IIMA is to help faculty members to test out their research findings at the pre-publication stage. Abstract We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are...

This paper describes an approach for scheduling a nuclear reactor that irradiates samples as required by customers. The environment involves a flowshop that consists of two stations, each composed of a set of parallel machines. Some jobs may be preempted, while others may not. Some jobs have deadlines, while others have due-dates. Some jobs require special tooling, while others do not. The prob...

This paper reviews the advances of mixed-integer linear programming (MILP) based approaches for the scheduling of chemical processing systems. We focus on the short-term scheduling of general network represented processes. First, the various mathematical models that have been proposed in the literature are classified mainly based on the time representation. Discrete-time and continuous-time mod...

In IACR ePrint 2014/747, a method for constructing mixedinteger linear programming (MILP) models whose feasible regions are exactly the sets of all possible differential (or linear) characteristics for a wide range of block ciphers is presented. These models can be used to search for or enumerate differential and linear characteristics of a block cipher automatically. However, for the case of S...