Work

A Comparison of Heuristics for Scheduling Problems in Textile Industry

Year: 2016

Type: article

Abstract: Scheduling is an important problem in textile industry. The scheduling problem in textile industry generally belongs to the flow shop scheduling problem (FSSP). There are many heuristics for solving this problem. Eight heuristics, namely FCFS, Gupta, Palmer, NEH, CDS, Dannenbring, Pour, and MOD are considered and compared. Experimental results show the best heuristic is NEH and the worst heuristic is FCFS.

Source: Jurnal Teknologi

DOI: 10.11113/jt.v78.9034

Authors: Cecilia E. Nugraheni, Luciana Abednego

Institution: Parahyangan Catholic University

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: diamond

Funder: Direktorat Jenderal Pendidikan Tinggi

OpenAlex ID: W2425503446

FWCI: 0.627

Cites: 8

Cited by: 10

Related to: 10