X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
computer science (22) 22
algorithm analysis and problem complexity (18) 18
operations research/decision theory (18) 18
optimization (17) 17
scheduling (17) 17
theory of computation (17) 17
artificial intelligence (15) 15
algorithms (14) 14
deteriorating jobs (14) 14
production scheduling (8) 8
operations research & management science (7) 7
processing times (7) 7
studies (7) 7
operations research (6) 6
computers (5) 5
single-machine (5) 5
complexity (4) 4
computer algorithms (4) 4
computer science, interdisciplinary applications (4) 4
computer science, theory & methods (4) 4
engineering, industrial (4) 4
linear programming (4) 4
mathematical models (4) 4
programming (4) 4
computational mathematics and numerical analysis (3) 3
computer capacity (3) 3
computer communication networks (3) 3
decision making (3) 3
dependent processing times (3) 3
deterioration (3) 3
heuristic algorithms (3) 3
linear deterioration (3) 3
mathematics of computing (3) 3
parallel processing (3) 3
polynomial algorithms (3) 3
precedence constraints (3) 3
schedules (3) 3
single machine (3) 3
software engineering/programming and operating systems (3) 3
tasks (3) 3
applied mathematics (2) 2
availability constraint (2) 2
business & economics (2) 2
complexity theory (2) 2
computer science, information systems (2) 2
computer simulation (2) 2
dedicated machines (2) 2
engineering, manufacturing (2) 2
general (2) 2
jobs (2) 2
lateness (2) 2
mathematical analysis (2) 2
mathematical optimization (2) 2
mathematical problems (2) 2
mathematics, applied (2) 2
memory structures (2) 2
operation research/decision theory (2) 2
optimal scheduling (2) 2
parallel machines (2) 2
planning (2) 2
processor scheduling (2) 2
production control (2) 2
shortening jobs (2) 2
single machine scheduling (2) 2
time complexity (2) 2
time-dependent scheduling (2) 2
total completion time (2) 2
universities and colleges (2) 2
weighted completion-time (2) 2
2-agent (1) 1
2-machine flowshop (1) 1
[formula omitted]-hard problems (1) 1
affaires (1) 1
agent scheduling (1) 1
agentenbasierte modellierung (1) 1
ai (1) 1
algorithms ; complexity (1) 1
algorithmus (1) 1
alterable jobs (1) 1
approximate algorithm (1) 1
approximation algorithms (1) 1
approximation scheme (1) 1
approximation schemes (1) 1
artificial thinking (1) 1
berechnungskomplexität (1) 1
boundaries (1) 1
bounds (1) 1
branch-and-bound algorithm (1) 1
branch-and-bound algorithms (1) 1
business (1) 1
business and management (1) 1
clusters (1) 1
combinatorics (1) 1
communication theory (1) 1
completion time (1) 1
computation (1) 1
computational complexity (1) 1
computer # internet / intranet (1) 1
computer capacity planning (1) 1
computer programming (1) 1
more...
Library Location Library Location
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, 2010, Volume 59, Issue 2, pp. 272 - 279
Journal Article
Annals of Operations Research, ISSN 0254-5330, 2/2014, Volume 213, Issue 1, pp. 131 - 145
Journal Article
Computers & operations research, ISSN 0305-0548, 12/2014, Volume 52, p. 135
  We consider scheduling jobs by two agents on a single machine. Each job is defined by a common release date, a deteriorating processing time that is a linear... 
Studies | Mathematical problems | Operations research | Optimization algorithms | Mathematical functions | Production scheduling | Heuristic
Journal Article
2014, 2014, ISBN 9783642418792, Volume 9783642418808, 281
This book presents multi-agent scheduling models in which subsets of jobs sharing the same resources are evaluated by different criteria. It discusses... 
Multiagent systems | Industrial applications | Production scheduling | Mathematical models | Computer simulation | Economics/Management Science | Models and Principles | Operation Research/Decision Theory | Computer scheduling
eBook
2018 23rd International Conference on Methods & Models in Automation & Robotics (MMAR), 08/2018, pp. 926 - 931
We consider a two-machine scheduling problem with a learning effect and the objective to minimize the schedule length. Jobs are preemptable but only preemption... 
Schedules | Scheduling | Production facilities | Processor scheduling | Resumes | Optimal scheduling
Conference Proceeding
Computers & industrial engineering, ISSN 0360-8352, 01/2013, Volume 64, Issue 1, p. 273
  We consider single-machine scheduling problems with variable job processing times, arbitrary precedence constraints and maximum cost criterion. We show how... 
Studies | Mathematical problems | Operations research | Production scheduling | Polynomials
Journal Article
2008, Monographs in Theoretical Computer Science, An EATCS Series, ISBN 3540694463
Web Resource
European Journal of Operational Research, ISSN 0377-2217, 2007, Volume 180, Issue 1, pp. 472 - 478
We consider two problems of scheduling a set of independent, non-preemptable and proportionally deteriorating jobs on a single machine. In the first problem,... 
Scheduling | Deteriorating jobs | Complexity theory | complexity theory | scheduling | deteriorating jobs | OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Journal Article
11/2010, Monographs in Theoretical Computer Science. an EATCS Ser., ISBN 3642088937
Annotation Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a... 
Computers | Computer Algorithms | Business & Economics | Computer Capacity | Production Control
Web Resource
11/2010, Monographs in Theoretical Computer Science. an EATCS Ser., ISBN 3642088937
Annotation Time-dependent scheduling involves problems in which the processing times of jobs depend on when those jobs are started. This book is a... 
Computers | Computer Algorithms | Business & Economics | Computer Capacity | Production Control
Web Resource
European journal of operational research, ISSN 0377-2217, 07/2007, Volume 180, Issue 1, p. 472
  We consider two problems of scheduling a set of independent, non-preemptable and proportionally deteriorating jobs on a single machine. In the first problem,... 
Studies | Problems | Scheduling | Machinery
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2010, Volume 200, Issue 1, pp. 305 - 308
A set of independent, resumable and proportionally deteriorating jobs is to be executed on a single machine. The machine is not continuously available for... 
Fully polynomial-time approximation scheme | Scheduling | Complexity theory | Deteriorating jobs | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | AVAILABILITY CONSTRAINT | Scheduling Deteriorating jobs Complexity theory Fully polynomial-time approximation scheme | Algorithms
Journal Article
Computers and Operations Research, ISSN 0305-0548, 12/2014, Volume 52, Issue Part A, pp. 135 - 146
Journal Article
2020, ISBN 3662593610, 535
This book provides a comprehensive study of complexity results and optimal and suboptimal algorithms concerning time-dependent scheduling in single-, parallel-... 
eBook
Journal of scheduling, ISSN 1099-1425, 2020, Volume 23, Issue 1, pp. 3 - 47
Journal Article
Journal of scheduling, ISSN 1094-6136, 07/2020
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 2010, Volume 216, Issue 2, pp. 438 - 447
We consider a new model of time-dependent scheduling. A set of deteriorating jobs has to be processed on a single machine which is available starting from a... 
Polynomial-time algorithms | Scheduling | [formula omitted]-hard problems | Single machine | Deteriorating jobs | NP-hard problems | MATHEMATICS, APPLIED | SINGLE-MACHINE | COMPLEXITY | LINEAR DETERIORATION | PROCESSING TIMES | Computation | Deterioration | Mathematical analysis | Lateness | Mathematical models | Boundaries | Completion time
Journal Article
Omega (Oxford), ISSN 0305-0483, 2015, Volume 57, pp. 196 - 202
We consider general properties which describe the structure of schedules for a single machine scheduling problem with linearly deteriorating jobs and the... 
The l p norm | Scheduling | Time complexity | Deteriorating jobs
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2009, Volume 196, Issue 3, pp. 919 - 929
We introduce a general transformation of parallel-machine time-dependent scheduling problems with critical lines. Using the transformation we define the class... 
Linear deterioration | Scheduling | Deteriorating jobs | TASKS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | COMPLEXITY | PROCESSING TIMES | Scheduling Deteriorating jobs Linear deterioration
Journal Article
No results were found for your search.

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