This paper addresses a complex real life manufacturing problem that occurs in paper and wood industries: the online bin packing and cutting of small items using parallel machines in a just-in-time environment. The objective is to minimize both the unused areas of the bins and the sum of weighted earliness and tardiness penalties. This NP hard problem is herein solved using an agent-based approa...

In this research, Lagrangian relaxation algorithms are proposed for Hybrid Flow-Shop (HFS) scheduling problems. Conventional HFS consists of a series of production stages, each of which has several identical parallel machines and no buffer spaces are considered. Jobs are processed through all stages in the same direction. In the previous researches, they are assumed that the capacity of buffer ...

The problem considered in this work consists scheduling a set of tasks on single machine, around an unrestrictive common due date to minimize the weighted sum earliness and tardiness. This can be formulated as compact mixed integer program (MIP). In article, we focus neighborhood-based dominance properties, where neighborhood is associated insert swap operations. We derive from these properties...

This paper considers the problem of scheduling a single machine, in which the objective function is to minimize the weighted quadratic earliness and tardiness penalties and no machine idle time is allowed. We develop a branch and bound algorithm involving the implementation of lower and upper bounding procedures as well as some dominance rules. The lower bound is designed based on a lagrangian ...

An Estimation of Distribution Algorithm (EDA), which depends on explicitly sampling mechanisms based on probabilistic models with information extracted from the parental solutions to generate new solutions, has constituted one of the major research areas in the field of evolutionary computation. The fact that no genetic operators are used in EDAs is a major characteristic differentiating EDAs f...

In this paper, a discrete artificial bee colony (DABC) algorithm is proposed to solve the lotstreaming flow shop scheduling problem with the criterion of total weighted earliness and tardiness penalties under both the idling and no-idling cases. Unlike the original ABC algorithm, the proposed DABC algorithm represents a food source as a discrete job permutation and applies discrete operators to...

Job scheduling has always been a challenging task in modern manufacturing and the most real life scheduling problems which involves multi-criteria and multi-machine environments. In this research our direction is largely motivated by the adoption of the Just-In-Time (JIT) philosophy in parallel machines system, where processing times of jobs are controllable. The goal of this paper is to minimi...