This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time. the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structu...

The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is motivated by scheduling the wafer fabrication phase of 300-mm semiconductor manufacturing, as it contains both batch processing operations and multiple customer orders being grouped into production jobs. The resulting m...

We study the scheduling of jobs on a single parallel-batching machine with non-identical job sizes and incompatible families. Jobs from same family have processing time can be loaded into batch, as long batch size respects capacity. The objective is to minimize total weighted completion time; this common equivalent minimization in-process inventory when all release date. Our problem combines tw...

This article explores why women miss out in the transition from educational system to labour market. Using nationally representative longitudinal data (2001–18) Household Income and Labour Dynamics Australia (HILDA) survey, we compare how long after graduation it takes men with tertiary qualifications (n = 2030) achieve key market milestones: (1) getting a full-time job; (2) permanent contract;...

This paper studies a scheduling problem with non-identical job sizes, arbitrary ready times, and incompatible family constraints for unrelated parallel batch processing machines, where the batches are limited to jobs from same family. The objective is minimize maximum completion time (makespan). important has wide applications in semiconductor manufacturing industries. study proposes mixed inte...