Skip to main navigation
Skip to search
Skip to main content
University of Nottingham Ningbo China Home
Home
Profiles
Research units
Research output
Projects
Prizes
Activities
Press/Media
Impacts
Student theses
Search by expertise, name or affiliation
Just-in-Time Scheduling Problem with Affine Idleness Cost
Zhen Tan
,
Guanqi Fu
Department of Entrepreneurship, Marketing and Management Systems
Nottingham University Business School China
Research output
:
Journal Publication
›
Article
›
peer-review
2
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Just-in-Time Scheduling Problem with Affine Idleness Cost'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Scheduling Problem
100%
Idleness
100%
Affine
100%
Just-in-time Scheduling
100%
Idle Time
50%
Genetic Algorithm
50%
Dynamic Programming Algorithm
50%
Cost Function
50%
Optimal Cost
50%
Evolutionary
25%
Hybrid Method
25%
Dynamic Programming
25%
Large-scale Problems
25%
Time Parameter
25%
Problem Instances
25%
Processing Time
25%
Due Date
25%
Low Computational Complexity
25%
Exact Timing
25%
Hybrid Solutions
25%
Non-convexity
25%
Earliness-tardiness
25%
Non-preemptive
25%
Screening Scheme
25%
Integer Values
25%
Local Convergence
25%
Fast Screening
25%
Job-specific
25%
Number of Segments
25%
Customized Genetic Algorithm
25%
Subsequence
25%
Total Earliness
25%
Elitist
25%
Exact Algorithm
25%
Single Machine Scheduling Problem
25%
Computer Science
Scheduling Problem
100%
Genetic Algorithm
100%
Just-in-Time
100%
Dynamic Programming Algorithm
66%
Experimental Result
33%
Time Complexity
33%
Problem Instance
33%
Time Parameter
33%
Processing Time
33%
Dynamic Programming
33%
single machine scheduling problem
33%
Hybrid Solution
33%
Exact Algorithm
33%
Engineering
Genetic Algorithm
100%
Dynamic Programming
100%
Cost Function
66%
Optimal Cost
66%
Experimental Result
33%
Hybrid Method
33%
Processing Time
33%
Exact Algorithm
33%
Mathematics
Genetic Algorithm
100%
Cost Function
66%
Integer
33%
Minimizes
33%
Time Parameter
33%
Single Machine
33%
Local Convergence
33%