Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Sequencing a single machine with due dates and deadlines: anILP-based approach to solve very large instances

Sequencing a single machine with due dates and deadlines: anILP-based approach to solve very... We consider the problem of minimizing the weighted number of tardy jobs on a single machine where each job is also subject to a deadline that cannot be violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure that allows to solve to optimality instances with up to 30,000 jobs in size, and up to 50,000 jobs in size for the special deadline-free case. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Scheduling Springer Journals

Sequencing a single machine with due dates and deadlines: anILP-based approach to solve very large instances

Loading next page...
 
/lp/springer-journals/sequencing-a-single-machine-with-due-dates-and-deadlines-anilp-based-W8CJD32skQ

References (19)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media, LLC
Subject
Business and Management; Operation Research/Decision Theory; Calculus of Variations and Optimal Control; Optimization; Optimization; Artificial Intelligence (incl. Robotics); Supply Chain Management
ISSN
1094-6136
eISSN
1099-1425
DOI
10.1007/s10951-008-0092-6
Publisher site
See Article on Publisher Site

Abstract

We consider the problem of minimizing the weighted number of tardy jobs on a single machine where each job is also subject to a deadline that cannot be violated. We propose an exact method based on a compact integer linear programming formulation of the problem and an effective reduction procedure that allows to solve to optimality instances with up to 30,000 jobs in size, and up to 50,000 jobs in size for the special deadline-free case.

Journal

Journal of SchedulingSpringer Journals

Published: Nov 6, 2008

There are no references for this article.