A hybrid heuristic approach to minimize number of tardy jobs in group technology systems-Reference-Cited by-同舟云学术

A hybrid heuristic approach to minimize number of tardy jobs in group technology systems

Published:2017-05-15 Issue:5 Volume:26 Page:1847-1867
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Bajwa Naeem¹^ORCID,Melouk Sharif²,Bryant Paul²

Affiliation:

1. Department of ManagementUniversity of Arkansas at Little Rock2801 South University AvenueLittle Rock AR 72204 USA

2. Department of Information Systems, Statistics, and Management ScienceUniversity of AlabamaTuscaloosa AL 35487‐0226 USA

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.12406

Reference52 articles.

1. A heuristic approach to batching and scheduling a single machine to minimize setup costs

2. A survey of scheduling problems with setup times or costs

3. An experimental comparison of solution algorithms for the single-machine tardiness problem

4. Note—Operations Sequencing in Discrete Parts Manufacturing

5. Single machine scheduling to minimize weighted earliness subject to no tardy jobs

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Single machine group scheduling jobs with resource allocations subject to unrestricted due date assignments;Journal of Applied Mathematics and Computing;2024-08-14

2. Optimal Different Due-Date Assignment Scheduling with Group Technology and Resource Allocation;Mathematics;2024-01-29

3. On optimal due date assignment without restriction and resource allocation in group technology scheduling;Journal of Combinatorial Optimization;2023-02-02

4. Minimizing Number of Tardy Jobs in Flow Shop Scheduling Using A Hybrid Whale Optimization Algorithm;Journal of Physics: Conference Series;2021-03-01

5. Optimal Due Date Assignment Without Restriction and Convex Resource Allocation in Group Technology Scheduling;Combinatorial Optimization and Applications;2021