A heuristic for single machine scheduling with early and tardy costs
Article Abstract:
Research is presented concerning the development of a constructive heuristic which can be used to reduce the difficulties occurring during the scheduling of jobs on a single machine which are subject to due dates and distinct ready times.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
User Contributions:
Comment about this article or add new information about this topic:
Constructive and composite heuristic solutions to the P//sigmaCi scheduling problem
Article Abstract:
Research is presented concerning the development of a constructive heuristic procedure which can be used to resolve the problem of permutation flowshop scheduling with a total flowtime minimization criterion.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
User Contributions:
Comment about this article or add new information about this topic:
Minimizing the number of tardy jobs for m parallel machines
Article Abstract:
Two basic heuristics for solving the problem of scheduling n jobs on m identical machines to minimize the number of late jobs in a parallel machine environment are introduced. The first, a machine-focused heuristic, is a modified version of Moore's algorithm for solving the single-machine tardy jobs minimization problem. A comparison of the heuristic and optimal solutions for 800 two-machine, ten-job problems is also discussed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: On alternative optimal solutions in the estimation of returns to scale in DEA. Super-efficiency and DEA sensitivity analysis
- Abstracts: The impact of business objectives and the time horizon of performance evaluation on pricing behavior. Explaining competitive reaction effects
- Abstracts: On computing objective function values in multiple objective quadratic-linear programming. A reference direction approach to multiple objective integer linear programming
- Abstracts: Storage controlled pile-up systems, theoretical foundations. Stack-up algorithms for palletizing at delivery industry