Results 291 to 300 of about 85,049 (338)
Some of the next articles are maybe not open access.
A genetic algorithm for flow shop scheduling problems
Journal of the Operational Research Society, 2004Summary: Many scheduling problems are NP-hard problems. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we develop a genetic algorithm-based heuristic for the flow shop scheduling problem with makespan as the criterion. The performance of the algorithm is compared
Wilson, J +3 more
openaire +3 more sources
Job-shop production scheduling with reverse flows
European Journal of Operational Research, 2013Abstract In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is characterized by two flows of jobs that cover the same machines in opposite directions. The objective is to minimize the maximal completion time of the jobs (i.e., the makespan).
Abdeljaouad, Mohamed Amine +3 more
openaire +5 more sources
Proportionate flow-shop scheduling with rejection
Journal of the Operational Research Society, 2016In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions.
Daniel Oron, Dvir Shabtay
openaire +1 more source
Proportionate Flow Shop Scheduling with Rejection
Asia-Pacific Journal of Operational Research, 2017We consider the problem of scheduling [Formula: see text] jobs with rejection on a set of [Formula: see text] machines in a proportionate flow shop system where the job processing times are machine-independent. The goal is to find a schedule to minimize the scheduling cost of all accepted jobs plus the total penalty of all rejected jobs.
Ren-Xia Chen +2 more
openaire +2 more sources
Routing open shop and flow shop scheduling problems
European Journal of Operational Research, 2011We consider a generalization of the classical open shop and flow shop scheduling problems where the jobs are located at the vertices of an undirected graph and the machines, initially located at the same vertex, have to travel along the graph to process the jobs. The objective is to minimize the makespan. In the tour-version the makespan means the time
Tijun Fan +3 more
openaire +2 more sources
A hybridisation of metaheuristics for flow shop scheduling
The International Journal of Advanced Manufacturing Technology, 2004The present paper deals with the formation of an optimal sequence of flow shop scheduling (FSS) for efficient operation. The primary concern of FSS is to obtain the optimal sequence, which minimises the idle time, tardiness, makespan, etc. Among these, the criteria of minimising the makespan plays a vital part.
A. Noorul Haq +3 more
openaire +2 more sources
Group scheduling in flexible flow shops
International Journal of Production Economics, 2005Abstract Flexible flow shops are becoming increasingly common in industry practice due to higher workloads imposed by jobs. As a result, one or more stages in a flexible flow shop will have two or more units of the same machine type. The group scheduling problem, comprised of two levels of scheduling, is investigated in this paper to minimize the ...
Sara Carson +2 more
openaire +2 more sources
Scheduling Practice and Recent Developments in Flow Shop and Job Shop Scheduling
2009Each plant and/or service provider performs several tasks to satisfy customer demand. Every task consumes several resources in order to be completed. Scheduling deals with the allocation of limited resources to tasks over time. Because the resources used in manufacturing activities are very limited, scheduling becomes a very important concept in ...
Betul Yagmahan, Mehmet Mutlu Yenisey
openaire +2 more sources
A heuristic for no-wait flow shop scheduling
The International Journal of Advanced Manufacturing Technology, 2013This paper presents an efficient heuristic method to minimize total flow time in no-wait flow shop scheduling. It is based on the assumption that the priority of a job in the initial sequence is given by the sum of its processing times on the bottleneck machines.
Sagar U. Sapkal, Dipak Laha
openaire +2 more sources
Analysis of flow shop scheduling anomalies
European Journal of Operational Research, 2020Abstract Anomalies in flow shop scheduling are rare; only two anomalies have been reported. We present five new anomalies for the permutation flow shop models with the minimum makespan objective and seven more anomalies for the minimum total flow time objective.
Christos Koulamas, S. S. Panwalkar
openaire +2 more sources