{"id":1095,"date":"2017-11-24T07:28:04","date_gmt":"2017-11-24T06:28:04","guid":{"rendered":"https:\/\/www.hsu-hh.de\/logistik\/?page_id=1095"},"modified":"2017-11-25T20:32:39","modified_gmt":"2017-11-25T19:32:39","slug":"multi-objective-production-scheduling","status":"publish","type":"page","link":"https:\/\/www.hsu-hh.de\/logistik\/research\/projects\/multi-objective-production-scheduling","title":{"rendered":"Multi-Objective Production Scheduling"},"content":{"rendered":"<p>MOOPPS is a computer system, designed to solve scheduling problem like machine scheduling, project scheduling,\u00a0<abbr title=\"et cetera\">etc.<\/abbr>\u00a0It combines an interactive schedule generator with artificial intelligence algorithms like A*, genetic algorithms, local search heuristics and others. The integration of preferences of the decision maker in the construction of optimal solutions is supported by a decision support module.<\/p>\n<p>Besides the optimization of the problem, the visualization and explanation of the implemented techniques is one of the main ideas of MOOPPS. Due to the fact, that there exists a huge variety of scheduling problem with the corresponding, differing objectives, the user should be able to &#8222;look behind&#8220; the algorithmic approaches and modify them in a straight-forward manner.<\/p>\n<p>After successfully competing in the finals in Ronneby, Sweden, the MOOPPS software has been awarded the European Academic\u00a0Software\u00a0Award 2002.<\/p>\n<figure id=\"attachment_512\" aria-describedby=\"caption-attachment-512\" style=\"width: 100px\" class=\"wp-caption aligncenter\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-512 size-full\" src=\"https:\/\/www.hsu-hh.de\/logistik\/wp-content\/uploads\/sites\/655\/2017\/10\/EASA2002.jpg\" alt=\"EASA 2002\" width=\"100\" height=\"136\" \/><figcaption id=\"caption-attachment-512\" class=\"wp-caption-text\">EASA 2002 certificate<\/figcaption><\/figure>\n<h3>Related key publications<\/h3>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-836 alignleft\" src=\"https:\/\/www.hsu-hh.de\/logistik\/wp-content\/uploads\/sites\/655\/2017\/10\/bQwpWg7KnULkCUZK.jpg\" alt=\"bQwpWg7KnULkCUZK\" width=\"71\" height=\"95\" \/>Martin Josef Geiger (2011):<br \/>\n<strong>Decision Support for Multi-Objective Flow Shop Scheduling by the Pareto Iterated Local Search Methodology.<\/strong><br \/>\nComputers &amp; Industrial Engineering, Volume 61, Issue 3, October 2011, Pages 805\u2013812, ISSN 0360-8352.<br \/>\n[<a href=\"http:\/\/dx.doi.org\/10.1016\/j.cie.2011.05.013\" target=\"_blank\" rel=\"noopener noreferrer\">doi:10.1016\/j.cie.2011.05.013<\/a>]<\/p>\n<hr \/>\n<p><img loading=\"lazy\" decoding=\"async\" class=\"size-full wp-image-846 alignleft\" src=\"https:\/\/www.hsu-hh.de\/logistik\/wp-content\/uploads\/sites\/655\/2017\/10\/K43D6k80o9dBochP-1.jpg\" alt=\"K43D6k80o9dBochP\" width=\"71\" height=\"99\" \/>Martin Josef Geiger (2007):<br \/>\n<strong>On operators and search space topology in multi-objective flow shop scheduling.<\/strong><br \/>\nEuropean Journal of Operational Research, Volume 181, Issue 1, August 2007, Pages 195\u2013206, ISSN 0377-2217.<br \/>\n[<a href=\"http:\/\/dx.doi.org\/10.1016\/j.ejor.2006.06.010\" target=\"_blank\" rel=\"noopener noreferrer\">doi:10.1016\/j.ejor.2006.06.010<\/a>]<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>MOOPPS is a computer system, designed to solve scheduling problem like machine scheduling, project scheduling,\u00a0etc.\u00a0It combines an interactive schedule generator with artificial intelligence algorithms like A*, genetic algorithms, local search [&hellip;]<\/p>\n","protected":false},"author":74,"featured_media":0,"parent":644,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[53],"tags":[],"class_list":["post-1095","page","type-page","status-publish","hentry","category-research-project"],"_links":{"self":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/1095","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/users\/74"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/comments?post=1095"}],"version-history":[{"count":5,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/1095\/revisions"}],"predecessor-version":[{"id":1200,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/1095\/revisions\/1200"}],"up":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/644"}],"wp:attachment":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/media?parent=1095"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/categories?post=1095"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/tags?post=1095"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}