Javascript must be enabled to continue!
A COMPARISON OF HEURISTICS FOR SCHEDULING PROBLEMS IN TEXTILE INDUSTRY
View through CrossRef
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.
Title: A COMPARISON OF HEURISTICS FOR SCHEDULING PROBLEMS IN TEXTILE INDUSTRY
Description:
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.
Related Results
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Leveraging Design Heuristics for Multi-Objective Metamaterial Design Optimization
Abstract
Design optimization of metamaterials and other complex systems often relies on the use of computationally expensive models. This makes it challenging to use...
Optimal irrigation scheduling combining water content sensors and remote sensing data
Optimal irrigation scheduling combining water content sensors and remote sensing data
By 2025, the Food and Agriculture Organization of the United Nations predicts that two-thirds of the world population will experience water stress conditions. In addition, it is ex...
Visual versus Tabular Scheduling Programs
Visual versus Tabular Scheduling Programs
Effective scheduling in construction is crucial for ensuring timely project completion and maintaining budget control. Scheduling programs play an important role in this process by...
DPTM: An Adaptive Scheduler Design Utilizing Timeslot Matching and Release Methods for Concurrent and Multi-task Interleaved Pipelining-oriented CGRA
DPTM: An Adaptive Scheduler Design Utilizing Timeslot Matching and Release Methods for Concurrent and Multi-task Interleaved Pipelining-oriented CGRA
Coarse-grained reconfigurable architectures (CGRAs) are increasingly employed as domain-specific accelerators due to their efficiency and flexibility. However, the existing CGRA ar...
Hybrid Meta-Heuristics Based Task Scheduling Algorithm for Energy Efficiency in Fog Computing
Hybrid Meta-Heuristics Based Task Scheduling Algorithm for Energy Efficiency in Fog Computing
Task scheduling in fog computing is one of the areas where researchers are having challenges as the demand grows for the use of Internet of Things (IoT) to access cloud computing r...
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Some of the most frequently used scheduling heuristics for resource constrained projects are Activity Time (ACTIM), Activity Resource (ACTRES) and Resource Over Time (ROT) which ar...
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement
Some of the most frequently used scheduling heuristics for resource constrained projects are Activity Time (ACTIM), Activity Resource (ACTRES) and Resource Over Time (ROT) which ar...
A study on Multi-objective Flexible Job-shop Dynamic Scheduling Based on Control Window
A study on Multi-objective Flexible Job-shop Dynamic Scheduling Based on Control Window
Abstract
It is of great practical significance to study the dynamic scheduling of production in flexible job-shop. In the flexible job-shop scheduling, process, cost...

