A scheduling heuristic for simultaneous minimization of makespan and total weighted tardiness in the open shop setup

The Open Shop Scheduling problem is a decision on how to schedule n independent jobs on m independent machines (n greater than or equal to m) when deterministic processing times are given and there exists no predefined sequence of machines operations for each job. The specific criteria for good sche...

Full description

Saved in:
Bibliographic Details
Main Author: Siy, Eric A.
Format: text
Language:English
Published: Animo Repository 1999
Subjects:
Online Access:https://animorepository.dlsu.edu.ph/etd_masteral/2048
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: De La Salle University
Language: English
Be the first to leave a comment!
You must be logged in first