Need for Standardization and Systematization of Test Data for Job-Shop Scheduling
The development of new and better optimization and approximation methods for Job Shop Scheduling Problems (JSP) uses simulations to compare their performance. The test data required for this has an uncertain influence on the simulation results, because the feasable search space can be changed drasti...
Main Authors: | Edzard Weber, Anselm Tiefenbacher, Norbert Gronau |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-02-01
|
Series: | Data |
Subjects: | |
Online Access: | https://www.mdpi.com/2306-5729/4/1/32 |
Similar Items
-
Dynamic scheduling and analysis of real time systems with multiprocessors
by: M.D. Nashid Anjum, et al.
Published: (2016-08-01) -
An improved sheep flock heredity algorithm for job shop scheduling and flow shop scheduling problems
by: Chandramouli Anandaraman
Published: (2011-10-01) -
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
Application of Tabu Search Algorithm in Job Shop Scheduling
by: Betrianis Betrianis, et al.
Published: (2010-10-01) -
A New Approach in Job Shop Scheduling: Overlapping Operation
by: parviz Fattahi, et al.
Published: (2010-02-01)