Keyphrases
Scheduling Problem
100%
Non-dominated Sorting Genetic Algorithm (NSGA-II)
100%
Printed Circuit Board
100%
Planners
100%
Multi-objective Scheduling
100%
Taiwan
50%
Resource Sharing
50%
Mathematical Model
50%
NP-hard
50%
Making Decisions
50%
Sequence-dependent Setup Times
50%
Heuristic Approach
50%
Near-optimal Solution
50%
Makespan
50%
Bi-objective
50%
Tardiness
50%
Precedence Constraints
50%
Release Time
50%
Gantt Chart
50%
Surface Mount Technology
50%
Feasible Schedule
50%
Planning Time
50%
Unrelated Parallel Machine Scheduling Problem (UPMSP)
50%
Job Release
50%
Work Order
50%
Machine Eligibility
50%
Production Data
50%
Real Set
50%
Printed Circuit Board Assembly
50%
Crowding Distance
50%
Pareto Front Solution
50%
Computer Science
Scheduling Problem
100%
Printed Circuit Board
100%
Production Planner
100%
Genetic Algorithm
100%
Machine Scheduling Problem
50%
Parallel Machine Scheduling
50%
Non-Dominated Sorting Genetic Algorithm II
50%
Shared Resource
50%
Precedence Constraint
50%
Gantt Chart
50%
Feasible Schedule
50%
Nearest Multiple
50%
Crowding Distance
50%
Computer Hardware
50%
Engineering
Genetic Algorithm
100%
Printed Circuit Board
100%
Setup Time
50%
Non-Dominated Sorting Genetic Algorithm II
50%
Surface Mount Technology
50%
Release Time
50%
Pareto Front
50%
Shared Resource
50%
Production Data
50%
Planning Time
50%
Crowding Distance
50%
Mathematical Model
50%