A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

DOI10.1080/002075498192689zbMath0953.90527OpenAlexW2131482998MaRDI QIDQ4245666

No author found.

Publication date: 8 June 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/002075498192689

zbMATH Keywords

genetic algorithmcomputational studyscheduling jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Frameworks for adaptable scheduling algorithms, A survey of scheduling problems with setup times or costs, Multicriteria scheduling problems: a survey, Earliness-tardiness scheduling with setup considerations, Counting and enumeration complexity with application to multicriteria scheduling