We consider the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012),...

This contribution presents algorithms, methods, and software for a Grid resource manager, responsible for resource brokering and scheduling in early production Grids. The broker selects computing resources based on actual job requirements and a number of criteria identifying the available resources, with the aim to minimize the total time to delivery for the individual application. The total ti...

This paper is concerned with detailed scheduling of job-shop like manufacturing systems. It addresses the scheduling of jobs, either simple, requiring the manufacture of a batch of parts, i.e. simple products, or complex, comprehending the parts fabrication and their multistage assembly into a batch of products. The Product-oriented Scheduling approach was adopted, assuming that full scheduling...

Variance within the manufacturing system leads to uneven shop loads, long manufacturing lead times, and unreliable customer service. This study compares techniques that reduce system variance to techniques that manage system variance. The study is placed in a dual resource constrained job shop. Results indicate that reducing system variance improves flow time and customer service performance me...

We consider the problem of common due-date to of simultaneously available jobs and sequencing them on a that a number of the jobs are tardy. The optimal combination of the common due-date and job sequence that minimizes the total absolute lateness. A simple to achieve this. Effectively three independent procedures : one to the nnT,nn<>1 sequence; a second to the optimal due date and a third to ...

We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling polic...

Abstract Meeting customer time requirements poses a major challenge in the context of high‐variety make‐to‐order companies. Companies need to reduce lead and process urgent jobs time, while realising high delivery reliability. The key decision stages within Workload Control (WLC) are order release shop floor dispatching. To best our knowledge, recent research has mainly focused on stage inadver...

The paper considers the problem of scheduling n jobs on a single machine to minimize the number of tardy jobs (or late jobs). Each job has a release date, a processing time and a due date. The general case with non-equal release dates and diierent due dates is considered. Various mixed-integer linear programming formulations are presented and discussed. A new polynomial solvable case is also in...

training is considered an important element in the organization, as it heavily influences people to learn how to be more effective at work by modifying knowledge, skills or attitudes through the learning experience to achieve a successful performance. likewise, training is a long term allegiance to all employees because they have to learn new skills and knowledge which become a turning point fo...