Heuristics for scheduling a single machine subject to unequal job release times
Article Abstract:
Heuristic methods are often needed to solve realistic scheduling problems within a reasonable amount of time. An example of such a problem is the single-machine sequencing problem with unequal release times for jobs. A generalization of a heuristic developed by J. Liu and B.L. MacCarthy was developed and used to solve large problems within a reasonable amount of computer time. The tabu search is also used to examine the quality of the solutions provided by the original heuristics.
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:
Multi-level, single-machine lot sizing and scheduling (with initial inventory)
Article Abstract:
A mixed-integer computer program for solving dynamic lot sizing and scheduling using a multi-level single machine is developed. Unlike single-level situations, the integration of initial inventory is essential to prevent loss of generality. Problem situations can be effectively solved to suboptimality by employing a randomized regret based heuristic. The current model can be extended to practical applications such as setup times, capacitated inventory and shortage management.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
Article Abstract:
A heuristic process for solving non-preemptive resource-constrained project scheduling problems in which resources are constrained but renewable from period to period is shown. The heuristic technique enumerates some schedulable combinations of tasks and selects from them the one having the best value for an evaluation criterion. Findings indicate that the suggested heuristic outclasses all other heuristics previously proposed.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Reducing simulation models for scheduling manufacturing facilities. A contribution to the stochastic flow shop scheduling problem
- Abstracts: Asymptomatic loss of priority scheduling policies in closed re-entrant lines: a computational study. Performance evaluations of cellular flexible manufacturing systems: a decomposition approach
- Abstracts: Backtracking of jobs in one-dimensional machine location problems. Optimal models for a multi-stage supply chain system controlled by kanban under just-in-time philosophy
- Abstracts: Production scheduling problems in a textile industry. A class of node based bottleneck improvement problems
- Abstracts: Revitalising suffering multinational brands: an empirical study. Asian brands without borders: regional opportunities and challenges