The CON Job scheduling problem on a single and parallel machines

UNCW Author/Contributor (non-UNCW co-authors, if there are any, appear on document)
Huajun Zhou (Creator)
The University of North Carolina Wilmington (UNCW )
Web Site:

Abstract: We study job scheduling problems on both a single machine and on independent identical parallel machines. We impose a due date cost and each of the jobs have earliness and tardiness costs. The single machine problem considers that all the jobs are processed by only one machine. The goal is to find the optimal due date that minimizes the cost. The parallel machines problem considers m identical machines which process the jobs simultaneously. We consider several variations of the problem. These include the constant flow allowance problem, job independent and job dependent cost problems, and the slack due date problem. Our main contribution is a new algorithm for job dependent costs on parallel machines.

Additional Information

A Thesis Submitted to the University of North Carolina at Wilmington in Partial Fulfillment Of the Requirements for the Degree of Master of Science
Language: English
Date: 2009
Algorithms, Operations research, Parallel processing (Electronic computers), Production scheduling, System analysis
Production scheduling
Parallel processing (Electronic computers)
Operations research
System analysis

Email this document to