This paper aims to study a real case of an optimization problem derived from hospital supply chain. The present work focuses on developing operational decision support models and algorithms for production process scheduling in catering. addressed system is considered as flexible job shop system. objective minimize the total flow time. A novel mathematical model two metaheuristics multi-product ...

As environmental awareness grows, energy-aware scheduling is attracting increasing attention. Compared with traditional flexible job shop problem (FJSP), FJSP, considering sequence-dependent setup times and transportation (FJSP-SDST-T), closer to real production. In existing research, little research has focused on FJSP-SDST-T the minimization energy consumption. order make up gap, a mixed inte...

This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under blocking constraint, which setup time machines depends not only on job to be processed but also previously one, i.e., there are sequence-dependent times. The performance analysis several iterated greedy algorithms different initial solution procedures and local searches lets us define an efficient a...

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops w...

In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...

Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...

The concept of irreducibility in shop scheduling problems withdifferent objectives has proven one of the most fertile research topics as theset of all irreducible sequences in a given shop contains at least one optimalsequence for arbitrary processing times. Recently, a number of equivalent for-mulations of the reducibility in open-shop problem with Makespan objectivesare pr...