execution time, which is less than or equal to 4/3 C
max_opt. The above problem is solved by means of
the software module PS6. The work of the module is
illustrated by the following numerical example.
Example 6. Consider the scheduling problem
with seven jobs which have to be processed on three
machines. The jobs processing times are the same as
in Example 4 and are given in Table 4.
The software module PS6 computes a
suboptimal schedule including the following
sequence of jobs processing.
- Job3, Job2, Job4 are processed on Machine 1,
- Job7 and Job5 are processed on Machine 2,
- Job6 and Job1 are processed on Machine 3.
In this case the maximal processing time is C
max
=13
which is obtained on Machine 1.
5 CONCLUSIONS
The paper presents a software implementation of six
algorithms intended to provide solutions to some
basic production scheduling problems and to
facilitate the production management in small and
medium enterprises. Our experimental program
system is open for adding new modules and in a
future work, a library of scheduling algorithms and
software modules can be developed and
incorporated in the system. In particular, the system
capabilities can be extended by using more elaborate
mathematical models of manufacturing processes
taking into account various processing
characteristics and constraints and different machine
environments.
ACKNOWLEDGEMENTS
The research work reported in the paper is supported
by the project AComIn "Advanced Computing for
Innovation", grant 316087, funded by the FP7
Capacity Programme (Research Potential of
Convergence Regions).
REFERENCES
Allahverdi, A., C. T. Ng, T. C. E. Cheng, M. Y.
Kovalyov, 2008. A survey of scheduling problems
with setup times or costs, European Journal of
Operational Research 187, pages 985–1032.
Baker, K. R., G. D. Scudder, 1990. Sequencing with
Earliness and Tardiness Penalties: A Review,
Operations Research, 38, pages 22–36.
Brucker, P., 2007. Scheduling Algorithms, 5-th edition,
Springer.
Conway, R. W., Maxwell, W. L., Miller, L. W., 1967.
Theory of Scheduling, Addison-Wesley Publishing
Company, Massachusettts.
Edis, E. B., C. Oguz, I. Ozkarahan, 2013. Parallel machine
scheduling with additional resources: Notation,
classification, models and solution methods, European
Journal of Operational Research 230, pages 449–463.
Framinan, J. M., Rubén Ruiz, 2010. Architecture of
manufacturing scheduling systems: Literature review
and an integrated proposal, European Journal of
Operational Research 205, pages 237–246.
Graham, R. E., E. L. Lawler, J. K. Lenstra, A. H. G.
Rinnooy Kan, 1979. Optimization and approximation
in deterministic sequencing and scheduling: a survey,
Annals of Discrete Mathematics, 4, pages 287-326.
Hoogeveen, H., 2005. Multicriteria scheduling, European
Journal of Operational Research, 167, pages 592–623.
Janiak, A., W. A. Janiak, T. Krysiak, T. Kwiatkowski,
2015. A survey on scheduling problems with due
windows, European Journal of Operational Research,
242, pages 347–357.
Kovalyov, M. Y., C. T. Ng, T. C. Edwin Cheng, 2007.
Fixed interval scheduling: Models, applications,
computational complexity and algorithms, European
Journal of Operational Research, 178, pages 331–342.
Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan and D.
Shmoys, 1993. Sequencing and Scheduling:
Algorithms and Complexity, in Handbooks in
Operations Research and Management Science, Vol.
4: Logistics of Production and Inventory, S. S. Graves,
A. H. G. Rinnooy Kan and P. Zipkin, (eds.), North-
Holland, New York, pages 445-522.
Lee, C. Y., 2004. Machine Scheduling with Availability
Constraints, Chapter 22 in Handbook of Scheduling, J.
Y.-T. Leung (ed.), Chapman and Hall/CRC, Boca
Raton, Florida.
Monov, V., T. Tashev, 2011. A programme
implementation of several inventory control
algorithms, Cybernetics and Information
Technologies, 11, pages 64-78.
Pinedo, M., 2008. Scheduling: Theory, Algorithms and
Systems, 3-rd edition, Springer.
Potts, C. N., M. Y. Kovalyov, 2000. Scheduling with
Batching: A Review, European Journal of Operational
Research, 120, pages 228–249.
Prot, D., O. Bellenguez-Morineau, C. Lahlou, 2013. New
complexity results for parallel identical machine
scheduling problems with preemption, release dates
and regular criteria, European Journal of Operational
Research, 231, pages 282–287.
Raghavachari, M., 1988. Scheduling Problems with Non-
Regular Penalty Functions: A Review, Opsearch, 25,
pages 144–164.
Fifth International Symposium on Business Modeling and Software Design
212