Two-machine flow shop scheduling with two criteria: maximum earliness and makespan
Article Abstract:
The two-machine flow shop scheduling problem with makespan and maximum earliness as two criteria is discussed. The computational results reveal that the branch-and -bound procedure is capable of solving problems with up to 25 jobs and the heuristic procedure produces approximate efficient solutions that are very close to exact efficient solutions in very small computation times.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
Article Abstract:
The problem of scheduling in permutation flowshops is considered with the aim to minimize the makespan followed by the consideration of minimization of total flowtime of jobs. Two any-colony optimization algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
Makespan minimization for two parallel machines with an availability constraint
Article Abstract:
The problems posed by the parallel machines in the absence of one another can be resolved and makespan can be minimized by partitioning the problem in to four and solving them each optimally using the algorithms.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Scheduling with monotonous earliness and tardiness penalties. Earliness-tardiness production planning for just-in-time manufacturing: a unifying approach by goal programming
- Abstracts: Single machine scheduling subject to deadlines and resource dependent processing times. Single machine batch scheduling with jointly compressible setup and processing times
- Abstracts: Coordinating supply chains with competition: capacity allocation in semiconductor manufacturing. A periodical floweringuharvesting model for delivering agricultural fresh products
- Abstracts: Entranced by London's high-rise housing. Life after death. Window dressing
- Abstracts: Advertising opportunities don't come much sweeter than this. Starbucks launches cash card