It is well-known that production scheduling can be largely categorized into open and closed-shops (Graves (1981)). Open-shops are job-shops, flow-shops, machine-shops and project-shops and deal exclusively with the assignment, sequencing and timing decisions (Pinedo (1995)). Closed-shops on the other hand also deal with the same three decision-groups as open-shops but they also must decide on t...

The job shop scheduling problem (JSP) arises in lowvolume production systems in which products are made to order. In such production systems, jobs usually differ considerably in their processing sequences and times. Solving the JSP is particularly important for the efficient utilization of production resources and for satisfying due dates. However, the JSP is fairly complex and known to be NP-h...

Abstract The distributed manufacturing has become a prevail production mode under the economic globalization. In this article, memetic discrete differential evolution (MDDE) algorithm is proposed to address permutation flow shop scheduling problem (DPFSP) with minimization of makespan. An enhanced NEH (Nawaz–Enscore–Ham) method presented produce potential candidate solutions and Taillard’s acce...

Based on a triple bottom line concept, sustainable development is characterized by the simultaneous pursuit of economic, environmental and social goals. The implementation this concept in production scheduling can result resolution Distributed Permutation Flow Shop Scheduling Problem (DPFSP). present study conceptually shifts an energy-efficient DPFSP to DPFSP, simultaneously contributing impro...

In the past, we have demonstrated how fuzzy concepts can easily be used in the Johnson algorithm to manage uncertain scheduling on two-machine flow shops. This paper extends application to fuzzy flow shops with more than two machines. A new fuzzy heuristic flow-shop scheduling algorithm (the fuzzy Palmer algorithm) is then designed since optimal solutions seem unnecessary for uncertain environm...

Transfer entropy is a measure of the magnitude and the direction of information flow between jointly distributed stochastic processes. In recent years, its permutation analogues are considered in the literature to estimate the transfer entropy by counting the number of occurrences of orderings of values, not the values themselves. It has been suggested that the method of permutation is easy to ...