https://ira.lib.polyu.edu.hk/bitstream/10397/1269/1/SetupSurvey-2006%28June-19%29.pdf

A survey of scheduling problems with setup times or costs

This paper presents an approach to solve dynamic scheduling of multi-task for hybrid flow-shop with the objective of minimizing the energy consumption. The idea of idle time window(ITW) is introduced, then the dynamic updating rules of the sets of ITWs are explained in detail. With the sets of ITWs of machines as constraints, the mathematical model is proposed for dynamic scheduling of multi-task for hybrid flowshop with the objective of minimizing the energy consumption. The particle swarm optimization algorithm is employed to solve this problem. The results of simulation indicate that this approach satisfies the demand of dynamic scheduling of multitask with the objective of minimizing the energy consumption.

Dynamic scheduling of multi-task for hybrid flow-shop based on energy consumption

Article history: Received September 16, 2014 Received in revised format: June 12, 2015 Accepted July 6, 2015 Available online July 8 2015 In this paper, group scheduling problem in no-wait flexible flowshop is considered by considering two stages with group sequence-dependent setup times and random breakdown of the machines. Genetic algorithm and simulated annealing based heuristics have been proposed to solve the problem. The primary objective of scheduling is to minimize the maximum completion time of the jobs for two classes of small and large scale problems. Computational results show that both GA and SA algorithms perform properly, but SA appeared to provide better results for both small and large scale problems. Growing Science Ltd. All rights reserved. 6 © 201

/pdf/solving-group-scheduling-problem-in-no-wait-flexible-260e8thb8v.pdf

Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown

This paper addresses a flow-shop scheduling problem with identical parallel machines at each stage (machine center) for minimizing the sum of the earliness and tardiness costs. The criteria are to minimize maintenance and shortage costs. An efficient solution approach for hybrid flow-shop scheduling problem is presented. Three heuristic algorithms are developed and utilized in this approach. The first algorithm allocates jobs to machines and converts the hybrid flow-shop problem in to several flow-shop problems. Then each ordinary flow-shop problem is solved utilizing a second algorithm. The third algorithm performs resource leveling by comparing the remaining utilized resources. If there's no improvement in the solution after several iterations, the stopping condition is reached. Computational experiments in this research determines the optimum utilization of the limited resources (bottlenecks) and their superiority over SA/TS algorithm is shown and establishes a solution method for integer linear programming problems.

A Heuristic Algorithm for Hybrid Flow-Shop Production Scheduling to Minimize the Sum of the Earliness Andf Tardiness Costs

This paper studies the hybrid flow-shop scheduling problem with no-wait restrictions. The production process consists of two machine centers, one has a single machine and the other has more than one parallel machine. A greedy heuristic named least deviation algorithm is designed and its worst case performance is analyzed. Computational results are also given to show the algorithm's average performance compared with some other algorithms. The least deviation algorithm outperforms the others in most cases tested here, and it is of low computational complexity and is easy to carry out,thus it is of favorable application value.

A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage

This paper studies the two-stage no-wait hybrid flowshop scheduling problem where one of the two stages consists of several identical parallel machines and the setup and removal times of each job at each stage are separated from the processing time. In view of the NP-complete of this problem, heuristic algorithms regarding sequencing and assigning of jobs to each stage as independent procedure are proposed. Two theorems are also proposed for sequencing job procedure. Computational experience demonstrates the effectiveness of the heuristic algorithm including the proposed theorems in finding a near optimal schedule.

/pdf/scheduling-a-two-stage-no-wait-hybrid-flowshop-with-40ve9qv5k4.pdf

Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal 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.

Junlin Chang

Author Tools

Chat about Author

Papers

Scheduling a two-stage no-wait hybrid flowshop with separated setup and removal times