✦ LIBER ✦

Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness

✍ Scribed by Mahnam, Mehdi; Moslehi, Ghasem; Fatemi Ghomi, Seyyed Mohammad Taghi

Book ID: 121232502
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 621 KB
Volume: 57
Category: Article
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2013.01.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimizing weighted earliness and tardin

Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted

✍ Jaw-Yeh Chen; Sheng-Fuu Lin 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a br

Minimizing the weighted sum of maximum e

Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance

✍ Benmansour, Rachid; Allaoui, Hamid; Artiba, Abdelhakim; Hanafi, Saïd 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Minimizing maximum earliness and number

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

✍ Ehsan Molaee; Ghasem Moslehi; Mohammad Reisi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 413 KB

Simulated-annealing heuristics for the s

Simulated-annealing heuristics for the single-machine scheduling problem with learning and unequal job release times

✍ Chin-Chia Wu; Peng-Hsiang Hsu; Kunjung Lai 📂 Article 📅 2011 🏛 Society of Manufacturing Engineers 🌐 English ⚖ 252 KB

Minimizing the number of tardy jobs and

Minimizing the number of tardy jobs and maximum earliness in the single machine scheduling using an artificial immune system

✍ Mohammad Reisi; Ghasem Moslehi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 186 KB

Branch-and-bound method for minimizing t

Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates

✍ Rabia Nessah; Imed Kacem 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 252 KB