z-logo
open-access-imgOpen Access
Local Search Methods to Find Approximate Solution for The Sum of Two Criteria with Unequal Ready Times in Machine Scheduling Problem
Author(s) -
Tahani Jabbar Khraibet,
Waleed Khalid Jaber,
Lafta Abed Dawood
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/928/4/042013
Subject(s) - algorithm , computer science
This research concentrates on the study of SA / TS which is regarded as two of the approaches of modern artificial intelligence, to solve the problems of scheduling by single machine to minimize bi _ criteria 1 / r j / ∑ j = 1 n w j ( 1 − e − r c j ) + T max . This problem settled up to 30000 jobs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here