Dispatching problems for parallel machines in the TFT‐LCD assembly process
From MaRDI portal
Publication:6092611
DOI10.1111/itor.12760OpenAlexW2995273130MaRDI QIDQ6092611
Unnamed Author, Yeu-Shiang Huang, Jyh-Wen Ho
Publication date: 23 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.12760
Cites Work
- Unnamed Item
- Unnamed Item
- A real-time order acceptance and scheduling approach for permutation flow shop problems
- Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Parallel machine scheduling with earliness and tardiness penalties
- Integrated production and distribution scheduling with a perishable product
- A genetic algorithm for the flexible job-shop scheduling problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- An effective heuristic for minimising makespan on unrelated parallel machines
- Scheduling with product family set-up times: an application in TFT LCD manufacturing
- Reducibility among Combinatorial Problems
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Local search heuristics for two-stage flow shop problems with secondary criterion
This page was built for publication: Dispatching problems for parallel machines in the TFT‐LCD assembly process