IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v39y1992i1p53-65.html
   My bibliography  Save this article

On scheduling with ready‐times, due‐dates and vacations

Author

Listed:
  • V. Jorge Leon
  • S. David Wu

Abstract

A single machine sequencing problem is considered in which there are ready‐time and due‐date constraints on jobs and vacation constraints on the machine. Each vacation has fixed starting and finish time and no preemption is allowed for the jobs. The objective is to minimize maximum lateness. An intriguing feature of this formulation is that it allows sequencing in disconnected time windows. A relaxation of the problem is obtained by modeling the vacations as a set of jobs with flexible ready‐times and artificial due‐dates and a branch and bound algorithm is developed for the problem. In the algorithm, the search is not only guided by the bounds but also by a careful manipulation of the artificial due‐dates. Consequently; while searching in the relaxed solution space, solutions of the original problem are implicitly enumerated. Computational results indicate that the algorithm can satisfactorily solve problems with multiple vacations.

Suggested Citation

  • V. Jorge Leon & S. David Wu, 1992. "On scheduling with ready‐times, due‐dates and vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(1), pages 53-65, February.
    • Handle: RePEc:wly:navres:v:39:y:1992:i:1:p:53-65
    DOI: 10.1002/1520-6750(199202)39:13.0.CO;2-C
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199202)39:13.0.CO;2-C
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199202)39:13.0.CO;2-C?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. L. Gelders & P. R. Kleindorfer, 1974. "Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory," Operations Research, INFORMS, vol. 22(1), pages 46-60, February.
    2. Paul Bratley & Michael Florian & Pierre Robillard, 1973. "On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/Fmax) problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(1), pages 57-67, March.
    3. Linus Schrage, 1970. "Solving Resource-Constrained Network Problems by Implicit Enumeration—Nonpreemptive Case," Operations Research, INFORMS, vol. 18(2), pages 263-278, April.
    4. L. Gelders & P. R. Kleindorfer, 1975. "Coordinating Aggregate and Detailed Scheduling in the One-Machine Job Shop: II—Computation and Structure," Operations Research, INFORMS, vol. 23(2), pages 312-324, April.
    5. M. Florian & P. Trepant & G. McMahon, 1971. "An Implicit Enumeration Algorithm for the Machine Sequencing Problem," Management Science, INFORMS, vol. 17(12), pages 782-792, August.
    6. Kenneth R. Baker & Henry L. W. Nuttle, 1980. "Sequencing independent jobs with a single resource," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(3), pages 499-510, September.
    7. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos, 1998. "Job Shop Scheduling With Deadlines," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 329-353, December.
    2. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    2. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    3. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    4. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    5. Susana Fernandes & Helena Ramalhinho-Lourenço, 2007. "A simple optimised search heuristic for the job-shop scheduling problem," Economics Working Papers 1050, Department of Economics and Business, Universitat Pompeu Fabra.
    6. J. J. Kanet, 2007. "New Precedence Theorems for One-Machine Weighted Tardiness," Mathematics of Operations Research, INFORMS, vol. 32(3), pages 579-588, August.
    7. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    8. Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
    9. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    10. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    11. V. Balachandran, 1977. "A Survey of the Applications of the Operator Theory of Parametric Programming for the Transportation and Generalized Transportation Problems," Discussion Papers 300, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    12. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    13. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    14. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    15. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    16. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    17. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    18. Ansis Ozolins, 2020. "Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times," Operational Research, Springer, vol. 20(3), pages 1701-1728, September.
    19. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    20. Taudes, Alfred & Trcka, Michael & Lukanowicz, Martin, 2002. "Organizational learning in production networks," Journal of Economic Behavior & Organization, Elsevier, vol. 47(2), pages 141-163, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:39:y:1992:i:1:p:53-65. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.