Package org.cpsolver.ifs.example.jobshop Description
JobShop Problem.
The Job-shop scheduling problem (n,m,J,Cmax) is concerned with
ordering n jobs on m machines: each job is composed of an ordered list
of m operations and must be processed during a uninterrupted time
period of a given length on each of the m machines. The objective is
to minimise the makespan, i.e., the maximum of job completion times.
- Version:
- IFS 1.4 (Instructor Sectioning)
Copyright (C) 2024 Tomáš Müller
muller@unitime.org
http://muller.unitime.org
This library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 3 of the
License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not see
http://www.gnu.org/licenses/.
- Author:
- Tomáš Müller