Abstract
We propose and investigate a genetic algorithm for scheduling jobs about an unrestricted common due date on a single machine. The objective is to minimize total earliness and tardiness cost where early and tardy penalty rates are allowed to be arbitrary for each job. Jobs are classified into families and a family setup time is required between jobs from two different families. Results from a computational study are promising with close to optimal solutions obtained rather easily and quickly.
Original language | English (US) |
---|---|
Pages (from-to) | 2543-2551 |
Number of pages | 9 |
Journal | International Journal of Production Research |
Volume | 36 |
Issue number | 9 |
DOIs | |
State | Published - Sep 1998 |
Externally published | Yes |
ASJC Scopus subject areas
- Strategy and Management
- Management Science and Operations Research
- Industrial and Manufacturing Engineering