Article
Full entry |
PDF
(0.2 MB)
Feedback
PDF
(0.2 MB)
Feedback
Keywords:
flow-shop; case study; integer programming; heuristics
flow-shop; case study; integer programming; heuristics
Summary:
The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage flow-shop: the first stage of the job processing is represented by the machine adjustment for the respective job, and the second stage by the processing of the job itself on the adjusted machine. In other words, the job-processing consists of two tasks, where the first task is the machine adjustment for the job, and the second task is the job processing itself. A mathematical model is proposed, a heuristic method is formulated, and the NP hardness of the problem, called a “hybrid flow-shop with adjustment”, is proved.
References:
[1] Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer–Verlag, Berlin 1996. Zbl 0911.90201
[2] Cho, Y., Sahni, S.: Preemptive scheduling of independent jobs with release and due times on open, flow and job shops. Oper. Res. 29 (1981), 3, 511–522. DOI 10.1287/opre.29.3.511 | MR 0629191 | Zbl 0455.90043
[3] Kubzin, M., Strusevich, A.: Planning machine maintenance in two-machine shop scheduling. Oper. Res. 54, 4, 2006, 789–800. DOI 10.1287/opre.1060.0301 | Zbl 1167.90669
[4] Lenstra, J. K., Rinnooy Kan, A. H. G.: Complexity of scheduling under precedence constraints. Oper. Res. 26 (1978), 1, 22–35. DOI 10.1287/opre.26.1.22 | MR 0462553 | Zbl 0371.90060
Search
Partner of
