Please use this identifier to cite or link to this item:
Title: Planning and Scheduling
Authors: Yağmur, E.
Kesen, S.E.
Issue Date: 2023
Publisher: CRC Press
Abstract: Along with the complexity theory, scheduling problems are investigated based on their complexity, and new methods are searched to generate efficient solutions in a reasonable time for NP-hard problems. So approximation algorithms and heuristic approaches have come to the fore in recent studies. If developments both in the problem structures and solution techniques are considered, it is clearly seen that as the problem becomes more complex, state-of-the-art methods have become insufficient, and new challenges have emerged. Thus, it is inevitable that the changing conditions with the last Industrial Revolution will make a serious challenge in the scheduling literature, and it will even enforce all previously developed methods, which can no longer be applied effectively. © 2023 selection and editorial matter, Turan Paksoy and Muhammet Deveci; individual chapters, the contributors.
ISBN: 9781000846836
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collections

Files in This Item:
File SizeFormat 
9781003180302_previewpdf (1).pdf
  Until 2030-01-01
5.42 MBAdobe PDFView/Open    Request a copy
Show full item record

CORE Recommender

Page view(s)

checked on Nov 27, 2023


checked on Nov 27, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.