New Lower Bounds for The Best-Case Schedule in Groups of Permutable Operations

Yahouni, Zakaria; Mebarki, Nasser; Sari, Zaki

doi:10.1016/j.ifacol.2015.06.236

Cited by 3 publications

(6 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, computing the best-case schedule is NP-hard and a branch and bound method would be too much time consuming. For this reason, we use the lower bound presented in [25,26] for estimating the optimal value of this criterion.…”

Section: Decision Stage Of the Groups Of Permutable Jobsmentioning

confidence: 99%

A New HMI Scheduling Model Implemented on a Real Manufacturing Scheduling System

Yahouni

Mebarki

2018

Service Orientation in Holonic and Multi-Agent Manufacturing

View full text Add to dashboard Cite

Manufacturing scheduling systems operate in a highly dynamic environment where several perturbations occur during the execution of a schedule. These perturbations prevent the execution of the planned schedule exactly as it was supposed to. To cope with this drawback, some techniques propose several scheduling solutions instead of a unique one, allowing during the execution phase to select the appropriate schedule that hedges against the perturbations. This selection is effectively done by a human operator who plays a key role in decision-making because of his knowledge and expertise. But, because of the limited complexity that he can handle, he needs to cooperate with the machine to take efficient decisions. In this context, the Human-Machine-Interface (HMI) literature research in planning and scheduling is rather theoretical. This paper addresses this relation from a practicaloriented perspective by proposing a new HMI model adapted to the groups of permutable jobs method, which is one of the most used literature methods to cope with shop perturbations. A practical experiment using the proposed HMI is then conducted. The results stress the usability and the limits of the proposed model.

show abstract

Section: Decision Stage Of the Groups Of Permutable Jobsmentioning

confidence: 99%

A New HMI Scheduling Model Implemented on a Real Manufacturing Scheduling System

Yahouni

Mebarki

2018

Service Orientation in Holonic and Multi-Agent Manufacturing

View full text Add to dashboard Cite

show abstract

“…Methods that explicitly solve problem (GP 1 ) for shop problems in an exact or approximated way can be found in [20,24]. We illustrate these methods for the makespan objective (by considering that all d k, j are equal to 0).…”

Section: Best Earliest Schedule Within a Fixed Group Sequence For A Fmentioning

confidence: 99%

“…successor) group on machine M k . γ(G) denotes a lower bound of the completion time of group G. The computation of γ(G) is based on a one-machine relaxation by making the assumption that each machine has an infinite capacity [20,24]. Below, a lower bound for the earliest completion time of operation O k, j is denoted χ k, j .…”

Section: Best Earliest Schedule Within a Fixed Group Sequence For A Fmentioning

confidence: 99%

Robust Machine Scheduling Based on Group of Permutable Jobs

Artigues

Billaut

Cheref

et al. 2016

International Series in Operations Research &Amp; Management Science

View full text Add to dashboard Cite

This chapter presents the "group of permutable jobs" structure to represent set of solutions to disjunctive scheduling problems. Traditionally, solutions to disjunctive scheduling problems are represented by assigning sequence of jobs to each machine. The group of permutable jobs structure assigns an ordered partition of jobs to each machine, i.e. a group sequence. The permutation of jobs inside a group must be all feasible with respect to the problem constraints. Such a structure provides more flexibility to the end user and, in particular, allows a better reaction to unexpected events. The chapter considers the robust scheduling framework where uncertainty is modeled via a discrete set of scenarios, each scenario specifying the problem parameters values. The chapter reviews the models and algorithms that have been proposed in the literature for evaluating a group sequence with respect to scheduling objectives for a fixed scenario as well as the recoverable robust optimization methods that have been proposed for generating robust group sequence5) M 2 (4) 7 0 2 4 Fig. 9.9: Gantt representation of a group sequence for the single machine problem Example 2: Job Shop EnvironmentIn Fig. 9.10, two groups of permutable operations are proposed. The first one is composed by the operations of J 1 and J 3 performed on the first machine. The second is composed of the operations of the same jobs on the third machine. One can see that whatever the order of the operations inside each group, the sequence remains feasible. Of course, this flexibility has a price since the makespan is now equal to 32.

show abstract

“…This evaluation is an NP-Hard optimization problem that can be seen as a partial-solved scheduling problem. Tight lower bounds for the job shop scheduling problem have been proposed, the algorithm is described in [18,21]. Using this best-case evaluation during the reactive phase of GoPO should be of good interest for different reasons:…”

Section: Best-case Criteriamentioning

confidence: 99%

“…This best-case represents the best possible permutation in GoPO leading to the best final schedule for a given objective. The calculation of this final schedule is based on adapted lower bounds measuring the best completion time of operations and groups in a GoPO schedule [18]. This evaluation can be done in real-time and thus can be used during the reactive phase of GoPO.…”

Section: Introductionmentioning

confidence: 99%

Minimizing tardiness for job shop scheduling under uncertainties

Yahouni

Mebarki

Sari

2016

2016 International Conference on Control, Decision and Information Technologies (CoDIT)

View full text Add to dashboard Cite

Many disturbances can occur during the execution of a manufacturing scheduling process. To cope with this drawback, flexible solutions are proposed based on the offline and the online phase of the schedule. Groups of permutable operations is one of the most studied flexible scheduling methods bringing flexibility as well as quality to a schedule. The online phase of this method is based on a human-machine system allowing to choose in real-time one schedule from a set of schedules that fits best the real state of the system. In this paper, we propose and evaluate a new criterion called the best-case in order to be used in real-time during the online phase of the groups of permutable operations. This criterion offers an optimal or near-optimal solution from a set of solutions. The usefulness of this criterion is showed using a comparative review with two other criteria on a benchmark instances using the maximum tardiness objective.

show abstract

New Lower Bounds for The Best-Case Schedule in Groups of Permutable Operations

Cited by 3 publications

References 9 publications

A New HMI Scheduling Model Implemented on a Real Manufacturing Scheduling System

A New HMI Scheduling Model Implemented on a Real Manufacturing Scheduling System

Robust Machine Scheduling Based on Group of Permutable Jobs

Minimizing tardiness for job shop scheduling under uncertainties

Contact Info

Product

Resources

About