A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
From MaRDI portal
Publication:6066616
DOI10.1111/itor.12406OpenAlexW2614695781MaRDI QIDQ6066616
Naeem Bajwa, Sharif H. Melouk, Paul Bryant
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12406
Related Items (3)
Optimal due date assignment without restriction and convex resource allocation in group technology scheduling ⋮ A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem ⋮ On optimal due date assignment without restriction and resource allocation in group technology scheduling
Cites Work
- Unnamed Item
- A discrete version of particle swarm optimization for flowshop scheduling problems
- Group sequencing around a common due date
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Survey of scheduling research involving due date determination decisions
- A probabilistic heuristic for a computationally difficult set covering problem
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Minimizing the number of late jobs under the group technology assumption
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- Single machine scheduling with common due data assignment in a group technology environment
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Greedy randomized adaptive search procedures
- Scheduling with batching: A review
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
- A survey of scheduling problems with setup times or costs
- A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties
- A parallel hybrid metaheuristic for bicluster editing
- A research survey: review of flexible job shop scheduling techniques
- An annotated bibliography of GRASP-Part II: Applications
- Applications of the DM‐GRASP heuristic: a survey
- An annotated bibliography of GRASP – Part I: Algorithms
- The Fixed Job Schedule Problem with Spread-Time Constraints
- Note—Operations Sequencing in Discrete Parts Manufacturing
- The Single Machine Early/Tardy Problem
- A Greedy Heuristic for the Set-Covering Problem
- Algorithms for Scheduling Independent Tasks
- A Survey of Scheduling Rules
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- Stochastic sequencing with job families, set-up times, and due dates
- Multicriteria scheduling using fuzzy theory and tabu search
- Family-based dispatching: anticipating future jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
- A note on the complexity of family scheduling to minimize the number of late jobs
This page was built for publication: A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
