Publication: Zhang, Z., Gao, L., Li, X., Zhang, C., & Liu, Q. (2025). Solving flexible job shop scheduling problem with worker flexibility and outsourcing service time windows using an adaptive dual-population memetic algorithm. International Journal of Production Research, 1–34. https://doi.org/10.1080/00207543.2025.2590195 Description: 30 benchmark instances (Ben01 ~ Ben30) for flexible job-shop scheduling problem with worker flexibility and outsourcing service time windows (FJSPWO) is provided in this file. These instances are divided into three groups: small-scale problems (Ben01 ~ Ben10), medium-scale problems (Ben11 ~ Ben20), and large-scale problems (Ben21 ~ Ben30). It contains problems with different parameters, increasing the number of jobs from eight to 30, the number of machines from five to 15 (internal workshop: from four to 13, outsourcing workshop: from one to four), and the number of workers from four to 12. The explanations for the main variable names are as follows:1. InMachNum: The number of machines in the internal workshop.2. JobInfo: The processing information of the job (it is a structure) which includes the optional machine set for each operation and the corresponding processing time.3. JobNum: The number of jobs.4. MachineNum: The total number of machines.5. OperaMax: The maximum number of operations for all jobs.6. OperaNum: The total number of operations for all jobs.7. OperaVec: Operation number vector, displaying the number of operations for each job in sequence.8. OutMachNum: The number of machines in the outsourcing workshop.9. Periods: Time window number vector, showing the number of service time windows for each outsourcing machine in sequence.10. ServiceWindow: Time window information (it is a structure), which includes the start and end time for each time window.11. TransT: The transfer time between the two workshops12. WorkerInfo: Worker information (it is a structure), showing the set of controllable machines for each worker13. WorkerNum: The total number of workers.