Heuristic approaches for n/m/F/sigma Ci scheduling problems
Article Abstract:
Two heuristic procedures for solving flow shop scheduling problems with the objective function of minimizing the total job completion time in O(n2) time are proposed. The first reduces the idle time of a machine while the second, which is known as the smallest process distance rule, minimizes both the machine idle time and the job queue time by computing the distances of all unscheduled jobs. According to numerical experiments, both provide near optimal to optimal solutions with objective cost errors of less than two percent.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
The cutting stock problem with mixed objectives: two heuristics based on dynamic programming
Article Abstract:
Two dynamic programming-based heuristic methods were suggested to solve different types of industrial cutting stock problems. The HCUS (Heuristic Constraining the Utilisation of the Stored Bars) method is utilized in the sales department, where the time to present a solution is more important than the quality of the solution. The HCUSO (Heuristic Constraining the Utilisation of Stored and Ordered Bars) method, however, focuses on the quality of the solution over time.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
Heuristic procedure for minimizing makespan and the number of required pallets
Article Abstract:
A heuristic algorithm for minimizing the makespan or the period to complete a job sequence in flow-shop scheduling problems. The problem, which is represented as n/m/Cmax in the literature, involves the minimization of 'in-process inventory for a given value of the makespan.' This objective function, which is correlated to the transportation requirements, is achieved by a path-based algorithm for minimizing the number of pallets for a given makespan.
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: How to use structural constraints to compute an upper bound for the pallet loading problem
- Abstracts: Domestic appliances and audio visual equipment in France
- Abstracts: Domestic appliances and audio visual equipment in Italy
- Abstracts: Advisors appointed for Autostrade sale. Italian privatisation efforts face delays. New bill urges faster bank sales
- Abstracts: Ayek Molek affair provides glimpse of Malaysian style of doing business. Contradictory court decisions in Malaysia fuel concerns about integrity of judicial system