X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (919) 919
Publication (65) 65
Conference Proceeding (57) 57
Dissertation (18) 18
Book Chapter (4) 4
Book Review (2) 2
Reference (2) 2
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
scheduling (592) 592
operations research & management science (469) 469
algorithms (434) 434
engineering, industrial (266) 266
optimization (263) 263
total weighted tardiness (236) 236
engineering, manufacturing (231) 231
computer science, interdisciplinary applications (196) 196
production scheduling (190) 190
single-machine (176) 176
analysis (162) 162
minimize (153) 153
algorithm (144) 144
mathematical models (136) 136
heuristics (127) 127
weighted tardiness (127) 127
total weighted completion time (115) 115
genetic algorithm (114) 114
makespan (113) 113
heuristic (107) 107
weighted completion-time (106) 106
operations research (99) 99
studies (98) 98
jobs (95) 95
parallel machines (95) 95
completion time (90) 90
job shops (86) 86
mathematics, applied (85) 85
setup times (84) 84
release dates (80) 80
computer science (78) 78
single machine (78) 78
weighted number (76) 76
computer science, artificial intelligence (75) 75
genetic algorithms (74) 74
management (72) 72
tardiness (71) 71
tardy jobs (70) 70
automation & control systems (68) 68
engineering (66) 66
methods (64) 64
scheduling problem (63) 63
mathematical analysis (62) 62
earliness (61) 61
single machine scheduling (61) 61
usage (58) 58
operations research/decision theory (57) 57
tabu search (57) 57
machinery (55) 55
mechanical engineering (55) 55
artificial intelligence (53) 53
industrial and production engineering (51) 51
computation (50) 50
mathematics (50) 50
economics / management science (49) 49
search (48) 48
job shop scheduling (47) 47
research (47) 47
computer-aided engineering and design (46) 46
mathematical optimization (46) 46
models (46) 46
schedules (46) 46
bound algorithm (45) 45
dynamic programming (45) 45
costs (44) 44
engineering, multidisciplinary (44) 44
complexity (43) 43
due dates (43) 43
heuristik (43) 43
heuristic methods (42) 42
management science (42) 42
production management (42) 42
production/logistics/supply chain (42) 42
approximation (41) 41
branch (40) 40
dispatching rules (40) 40
magneto-electric machines (40) 40
deteriorating jobs (39) 39
flowshop (39) 39
lateness (39) 39
searching (39) 39
simulated annealing (39) 39
genetischer algorithmus (38) 38
integer programming (38) 38
machine (38) 38
minimization (37) 37
engineering, electrical & electronic (36) 36
shop (36) 36
times (36) 36
common due-date (35) 35
fertigungszeit (35) 35
polynomials (35) 35
time (35) 35
computer simulation (34) 34
calculus of variations and optimal control; optimization (33) 33
maximum lateness (33) 33
penalties (33) 33
production/logistics (33) 33
maschinenbelegung (32) 32
particle swarm optimization (32) 32
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Computers & Industrial Engineering, ISSN 0360-8352, 08/2018, Volume 122, pp. 211 - 218
This paper studies a two-stage assembly problem to minimize the total completion time. The two-stage assembly system consists of multiple machines in the first... 
Assembly system | Branch-and-bound | Scheduling | Total completion time | MACHINES | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | APPROXIMATION | BOUND ALGORITHM | ORDERS | ENGINEERING, INDUSTRIAL | TOTAL WEIGHTED FLOWTIME | PARALLEL
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 05/2019, Volume 275, Issue 1, pp. 67 - 79
We consider the problem of scheduling a set of jobs on a set of identical parallel machines, with the aim of minimizing the total weighted completion time. The... 
Parallel machines | Weighted completion time | Arc-flow formulations | Scheduling | BRANCH | BIN-PACKING | ALGORITHM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MODELS | JOBS | RELAXATIONS | BOUNDS | SCHEDULE | Integer programming | Scheduling (Management) | Usage | Analysis
Journal Article
Journal of Intelligent Manufacturing, ISSN 0956-5515, 12/2015, Volume 26, Issue 6, pp. 1099 - 1112
Journal Article
International Journal of Production Research, ISSN 0020-7543, 01/2019, Volume 57, Issue 2, pp. 567 - 581
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 07/2019
Journal Article
Engineering Optimization, ISSN 0305-215X, 01/2017, Volume 49, Issue 1, pp. 98 - 112
A given number of jobs in an open shop scheduling environment must each be processed for given amounts of time on each of a given set of machines in an... 
asymptotic analysis | Scheduling | discrete differential evolution | open shop | total weighted completion time | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ENGINEERING, MULTIDISCIPLINARY | OPTIMIZATION | MEAN FLOW TIME | Production scheduling | Job shops | Schedules | Algorithms | Polynomials | Machine shops | Optimization | Heuristic | Completion time
Journal Article
Applied Soft Computing Journal, ISSN 1568-4946, 09/2018, Volume 70, pp. 147 - 156
Journal Article
Computers and Operations Research, ISSN 0305-0548, 01/2013, Volume 40, Issue 1, pp. 353 - 361
In many management situations multiple agents pursuing different objectives compete on the usage of common processing resources. In this paper we study a... 
Two agents | Total weighted completion time | Scheduling | Maximum lateness | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | DATES | ENGINEERING, INDUSTRIAL | Algorithms | Computation | Lateness | Simulated annealing | Mathematical models | Resource management | Completion time
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 01/2016, Volume 273, pp. 570 - 583
In this paper, we study the online scheduling of linear deteriorating jobs on a single machine to minimize the total weighted completion time. In the problem,... 
Online algorithms | Total weighted completion time | Scheduling | Linear deterioration | MATHEMATICS, APPLIED | SINGLE-MACHINE | MAKESPAN | ALGORITHM | DEPENDENT PROCESSING TIMES | RELEASE DATES | Algorithms
Journal Article
Operations Research Letters, ISSN 0167-6377, 09/2018, Volume 46, Issue 5, pp. 505 - 509
We present a -approximation algorithm for the classical nonpreemptive scheduling problem to minimize the total weighted completion time of jobs on identical... 
Precedence constraints | Total weighted completion time | Scheduling | Approximation algorithm | Time-indexed LP relaxation | GENERAL-CLASS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | BOUNDS | SCHEDULING PROBLEMS
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 2011, Volume 217, Issue 9, pp. 4819 - 4826
In this paper, we address a two-machine flow shop scheduling problem under simple linear deterioration. By a simple linear deterioration function, we mean that... 
Total weighted completion time | Scheduling | Flow shop | Simple linear deterioration | Branch-and-bound algorithm | Heuristic algorithm | BRANCH | MATHEMATICS, APPLIED | TASKS | JOBS | DOMINANT MACHINES | COMPLEXITY | DEPENDENT PROCESSING TIMES | Analysis | Algorithms | Computation | Deterioration | Mathematical analysis | Heuristic methods | Dominance | Mathematical models | Completion time
Journal Article
by Wei, HJ and Yuan, JJ and Gao, Y
MATHEMATICS, ISSN 2227-7390, 09/2019, Volume 7, Issue 9, p. 819
We consider the coordination of transportation and batching scheduling with one single vehicle for minimizing total weighted completion time. The computational... 
unary NP-hard | MATHEMATICS | Transportation | approximation algorithm | batching scheduling | 2-MACHINE FLOWSHOP | COORDINATION | MACHINE | total weighted completion time
Journal Article
Computers and Mathematics with Applications, ISSN 0898-1221, 2009, Volume 57, Issue 4, pp. 619 - 623
We study a single machine scheduling problem. The processor needs to go through a maintenance activity, which has to be completed prior to a given deadline.... 
Weighted completion time | Maintenance activity | Scheduling | Dynamic programming | Heuristics | Single machine | MATHEMATICS, APPLIED | NONRESUMABLE JOBS | SINGLE-MACHINE | MAKESPAN | PERIODIC MAINTENANCE | Algorithms | Computer simulation | Microprocessors | Mathematical analysis | Mathematical models | Maintenance | Completion time
Journal Article
Information Processing Letters, ISSN 0020-0190, 2009, Volume 109, Issue 16, pp. 913 - 917
We consider a multi-agent scheduling problem on a single machine in which each agent is responsible for his own set of jobs and wishes to minimize the total... 
Total weighted completion time | Multi-agent scheduling | Approximation algorithm | FPTAS | Multi-Objective Shortest-Path problem | OBJECTIVES | COMPUTER SCIENCE, INFORMATION SYSTEMS | Algorithms | Management science
Journal Article
Operations Research Letters, ISSN 0167-6377, 01/2019, Volume 47, Issue 1, pp. 41 - 46
We consider the classical two-machine flow-shop scheduling for minimizing the total weighted completion time. For this problem, the computational complexity of... 
Total weighted completion time | NP-hard | Scheduling | Flow shop | Approximation algorithm | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRANSPORTATION | COORDINATION
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.