This paper gives the positive answer to the question posed in the title for a wide class of minimization criteria including the maximum completion time, maximum lateness , total completion time, total weighted completion time, total tardiness, total weighted tardiness, number of late jobs and the weighted number of late jobs. That is any scheduling problem for m identical parallel machines to m...

Jeremy P. Erickson: Managing Tardiness Bounds and Overload in Soft Real-Time Systems (Under the direction of James H. Anderson) In some systems, such as future generations of unmanned aerial vehicles (UAVs), different software running on the same machine will require different timing guarantees. For example, flight control software has hard real-time (HRT) requirements—if a job (i.e., invocatio...

This paper studies a hierarchical optimization problem of scheduling n jobs on serial-batching machine, in which two objective functions are maximum costs. By problem, we mean the optimizing secondary criterion under constraint that primary is optimized. A machine can handle up to b batch and start complete respectively at same time processing equal sum times batch. When new starts, constant se...

The research focuses on the multi-objective single-machine static scheduling problems of motorcycle crankcase cover. To solve these problems, dispatching rules are used. Various used in this study earliest due date (EDD), shortest processing time (SPT), critical ratio (CR), longest (LPT), weightage (WSPT), cost over (COVERT), and hodgson’s algorithm. objective paper is to sequence different cov...

The present article proposes an exact algorithm for the single-machine scheduling problem to minimize sum of total completion times, range lateness and maximum tardiness on a single machine (1/ /(∑ C_(σ_j + R_L T_max)), where idle time is prohibited. In this paper, one multiobjective function criteria just being studied. To obtain optimal solution suggested problem, we propose use Branch Bound ...