Adjusting scheduling model with release and due dates in production planning

References

• Bratley, P., Florian, M., & Robillard, P. (1973). On sequencing with earliest start times and due-dates with application to computing bounds for (n/m/G/Fmax) problem. Naval Research Logistics Quarterly., 20, 57–67.
   Google Scholar
• Brinkkotter, W., & Brucker, P. (2001). Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments. Journal of Scheduling, 4, 53–64.
   Web of Science ®Google Scholar
• Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research., 11, 42–47.
   Web of Science ®Google Scholar
• Carlier, J., & Pinson, E. (1989). An algorithm for solving job shop problem. Management Science, 35, 164–176.
   Web of Science ®Google Scholar
• Carlier, J., & Pinson, E. (1998). Jakson’s pseudo preemptive schedule for the Pm/ri,qi/Cmax problem. Annals of Operations Research, 83, 41–58.
   Web of Science ®Google Scholar
• Condotta, A., Knust, S., & Shakhlevich, N. V. (2010). Parallel batch scheduling of equal-length jobs with release and due dates. Journal of Scheduling, 13, 463–477.
   Web of Science ®Google Scholar
• Della Croce, F., & T’kindt, V. (2010). Improving the preemptive bound for the single machine dynamic maximum lateness problem. Operations Research Letters, 38, 589–591.
   Web of Science ®Google Scholar
• Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco, CA: Freeman.
   Google Scholar
• Garey, M. R., Johnson, D. S., Simons, B. B., & Tarjan, R. E. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing, 10, 256–269.
   Web of Science ®Google Scholar
• Gharbi, A., & Labidi, M. (2010). Jackson’s semi-preemptive scheduling on a single machine. Computers & Operations Research, 37, 2082–2088.
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. L., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A servey. Annals of Discrete Mathematics, 5, 287–326.
   Google Scholar
• Hall, L. A., & Shmoys, D. B. (1992). Jackson’s rule for single-machine scheduling: Making a good heuristic better. Mathematics of Operations Research, 17, 22–35.
   Web of Science ®Google Scholar
• Hoogeveen, J. A. (1995). Minimizing maximum promptness and maximum lateness on a single machine. Annals of Discrete Mathematics, 21, 100–114.
   Google Scholar
• Jackson, J. R. (1955). Schedulig a production line to minimize the maximum tardiness. Manegement Scince Research Project. Los Angeles: University of California.
   Google Scholar
• McMahon, G., & Florian, M. (1975). On scheduling with ready times and due dates to minimize maximum lateness. Operations Research, 23, 475–482.
   Web of Science ®Google Scholar
• Nowicki, E., & Smutnicki, C. (1994). An approximation algorithm for a single-machine scheduling problem with release times and delivery times. Discrete Applied Mathematics, 48, 69–79.
   Web of Science ®Google Scholar
• Perregaard, M., & Clausen, J. (1998). Parallel branch-and-bound methods for the job-shop scheduling problem. Annals of Operations Research, 83, 137–160.
   Web of Science ®Google Scholar
• Potts, C. N. (1980). Analysis of a heuristic for one machine sequencing with release dates and delivery times. Operations Research, 28, 1436–1441.
   Web of Science ®Google Scholar
• Schrage, L. (1971, March). Obtaining optimal solutions to resource constrained network scheduling problems. Unpublished manuscript.
   Google Scholar
• Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12, 294–299.
   Web of Science ®Google Scholar
• Simons, B., & Warmuth, M. (1989). A fast algorithm for multiprocessor scheduling of unit-length jobs. SIAM Journal on Computing, 18, 690–710.
   Web of Science ®Google Scholar
• Vakhania, N. (2003). A better algorithm for sequencing with release and delivery times on identical processors. Journal of Algorithms, 48, 273–293.
   Web of Science ®Google Scholar
• Vakhania, N. (2004). Single-machine scheduling with release times and tails. Annals of Operations Research, 129, 253–271.
   Web of Science ®Google Scholar
• Vakhania, N. (2009). Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs. Operations Research Letters, 37, 405–410.
   Web of Science ®Google Scholar
• Vakhania, N. (2012). Branch less, cut more and minimize the number of late equal-length jobs on identical machines. Theoretical Computer Science, 465, 49–60.
   Web of Science ®Google Scholar
• Vakhania, N. (2013). A study of single-machine scheduling problem to maximize throughput. Journal of Scheduling, 16, 395–403.
   Web of Science ®Google Scholar
• Vakhania, N., & Shchepin, E. (2002). Concurrent operations can be parallelized in scheduling multiprocessor job shop. Journal of Scheduling, 5, 227–245.
   Web of Science ®Google Scholar
• Vakhania, N., Perez, D., & Carballo, L. Theoretical expectation versus practical performance of Jackson’s heuristic. Mathematical Problems in Engineering, 2015, 10 pages. doi:10.1155/2015/484671
   Web of Science ®Google Scholar