The majority of scheduling research assumes setup as negligible or part of the processing time. While this assumption simplifies the analysis and/or reflects certain applications, it adversely affects the solution quality for many applications which require explicit treatment of setup. Such applications, coupled with the emergence of production concepts like time-based competition and group technology, have motivated increasing interest to include setup considerations in scheduling problems. This paper provides a comprehensive review of the literature on scheduling problems involving setup times (costs). It classifies scheduling problems into batch and non-batch, sequence-independent and sequence-dependent setup, and categorizes the literature according to the shop environments of single machine, parallel machines, flowshops, and job shops. The suggested classification scheme organizes the scheduling literature involving setup considerations, summarizes the current research results for different problem types, and finally provides guidelines for future research.

A review of scheduling research involving setup considerations

Flowshop scheduling problems with setup times arise naturally in many practical situations. This paper provides a review of static and deterministic flowshop scheduling research involving machine setup times. The literature is classified into four broad categories, namely sequence independent job setup times, sequence dependent job setup times, sequence independent family setup times, and sequence dependent family setup times. Using the suggested classification scheme, this paper organizes the flowshop scheduling literature involving setup and/or removal times and summarizes the existing research for different flowshop problem types. This review reveals that, while a considerable body of literature on this subject has been created, there still exist several potential areas worthy of further research.

A review of flowshop scheduling research with setup times

This study strives to minimize multi-objective flexible flowshop considering sequence-dependent setup times. The flowshop scheduling problem made up of n jobs that have to be processed on m machine. But a flexible flowshop scheduling problem should have more than one machine in at least one stage. As this problem is proven to be NP-hard, a multi-phase approach is developed to solve it. Both phases two and three improve their previous phase solutions, in order to tackle with the complexity of being multi-objective optimization, Pareto archive concepts have been implemented here. The parameters of the proposed algorithm are calibrated using a design of experiment (DOE) method. We investigate the performance of our algorithm through comparing two last stage of it with a distinguished benchmark, multi-objective genetic algorithm (MOGA). The computational results support the high performance of our innovative algorithm.

Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach

Lot streaming combined lot splitting with operations overlapping is one of the effective techniques used to implement the time-based strategy in today's era of global competition. Therefore, this technique has been studied extensively over the past few decades. In this paper, we first propose a uniquely categorized structure to characterize the existing lot streaming problems in terms of three main dimensions, seven subdimensions, and 17 levels. Then, a notation set is defined to systematically express each existing lot streaming problem by seven ordered elements corresponding to the seven subdimensions. Based on the classification structure and the defined notation set, a comprehensive survey is presented to make up for the lack of a literature review on this subject. The objective is to help the reader gain a clear understanding of the evolution of previous research on lot streaming. This paper concludes with some constructive suggestions for future research directions.

A comprehensive review of lot streaming

A comprehensive review of flowshop group scheduling literature

Unit sized transfer batch scheduling with setup times

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

F. Can Çinkaya

Author Tools

Chat about Author

Papers

Unit sized transfer batch scheduling with setup times