ALGORITHMS FOR SCHEDULING A SINGLE MACHINE TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS.
- Published in:
- Management Science, 1988, v. 34, n. 7, p. 843, doi. 10.1287/mnsc.34.7.843
- By:
- Publication type:
- Article
Works by Potts, C. N.
Results: 17
1
2
Bicriteria efficiency/equity hierarchical location models for public service application.
- Published in:
- Journal of the Operational Research Society, 2013, v. 64, n. 4, p. 500, doi. 10.1057/jors.2012.68
- By:
- Publication type:
- Article
3
Fifty years of scheduling: a survey of milestones.
- Published in:
- Journal of the Operational Research Society, 2009, p. S41, doi. 10.1057/jors.2009.2
- By:
- Publication type:
- Article
4
A variable neighbourhood search algorithm for the constrained task allocation problem.
- Published in:
- Journal of the Operational Research Society, 2008, v. 59, n. 6, p. 812, doi. 10.1057/palgrave.jors.2602413
- By:
- Publication type:
- Article
5
Editorial.
- Published in:
- 2004
- By:
- Publication type:
- Editorial
6
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs.
- Published in:
- Annals of Operations Research, 1999, v. 92, n. 1-4, p. 107, doi. 10.1023/A:1018974428912
- By:
- Publication type:
- Article
7
Scheduling multi-operation jobs on a single machine.
- Published in:
- Annals of Operations Research, 1999, v. 92, n. 1-4, p. 87, doi. 10.1023/A:1018959420252
- By:
- Publication type:
- Article
8
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time.
- Published in:
- Annals of Operations Research, 1998, v. 83, n. 1-4, p. 59, doi. 10.1023/A:1018920416308
- By:
- Publication type:
- Article
9
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time.
- Published in:
- Annals of Operations Research, 1997, v. 70, n. 1-4, p. 261, doi. 10.1023/A:1018978322417
- By:
- Publication type:
- Article
10
Single machine scheduling with batch set-up time to minimize maximum lateness.
- Published in:
- Annals of Operations Research, 1997, v. 70, n. 1-4, p. 75, doi. 10.1023/A:1018903027868
- By:
- Publication type:
- Article
11
Scheduling a two-stage hybrid flow shop with parallel machines at the first stage.
- Published in:
- Annals of Operations Research, 1997, v. 69, n. 1-4, p. 171, doi. 10.1023/A:1018976827443
- By:
- Publication type:
- Article
12
Two-machine no-wait flow shop scheduling with missing operations.
- Published in:
- Mathematics of Operations Research, 1999, v. 24, n. 4, p. 911, doi. 10.1287/moor.24.4.911
- By:
- Publication type:
- Article
13
A FULLY POLYNOMIAL APPROXIMATION SCHEME FOR SCHEDULING A SINGLE MACHINE TO MINIMIZE TOTAL WEIGHTED LATE WORK.
- Published in:
- Mathematics of Operations Research, 1994, v. 19, n. 1, p. 86, doi. 10.1287/moor.19.1.86
- By:
- Publication type:
- Article
14
ANALYSIS OF HEURISTICS FOR TWO-MACHINE FLOW-SHOP SEQUENCING SUBJECT TO RELEASE DATES.
- Published in:
- Mathematics of Operations Research, 1985, v. 10, n. 4, p. 576, doi. 10.1287/moor.10.4.576
- By:
- Publication type:
- Article
15
Single Machine Scheduling to Minimize Total Weighted Late Work.
- Published in:
- ORSA Journal on Computing, 1995, v. 7, n. 2, p. 232, doi. 10.1287/ijoc.7.2.232
- By:
- Publication type:
- Article
16
SINGLE MACHINE SCHEDULING TO MINIMIZE TOTAL LATE WORK.
- Published in:
- Operations Research, 1992, v. 40, n. 3, p. 586, doi. 10.1287/opre.40.3.586
- By:
- Publication type:
- Article
17
Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times.
- Published in:
- Operations Research, 1980, v. 28, n. 6, p. 1436, doi. 10.1287/opre.28.6.1436
- By:
- Publication type:
- Article