We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is...

Open shop scheduling problems (OSSP) are highly significant in engineering and industry, involving critical scheduling challenges. The job type determines the duration required for material transfer between machines and remains unaffected by distance, eliminating any waiting time for transfers....

In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We...