请用c语言写一个多道程序系统的作业调度模拟程序

好的，以下是一个简单的多道程序系统的作业调度模拟程序的 C 语言代码，供参考：

#include <stdio.h>
#include <stdlib.h>

#define MAX_JOBS 100

typedef struct {
    int id;
    int arrival_time;
    int burst_time;
    int remaining_time;
} job_t;

typedef struct {
    job_t *jobs[MAX_JOBS];
    int num_jobs;
} job_queue_t;

void init_job_queue(job_queue_t *queue) {
    queue->num_jobs = 0;
}

void add_job_to_queue(job_queue_t *queue, job_t *job) {
    if (queue->num_jobs >= MAX_JOBS) {
        printf("Error: queue is full\n");
        exit(1);
    }
    queue->jobs[queue->num_jobs++] = job;
}

void execute_job(job_t *job) {
    job->remaining_time--;
}

int is_job_completed(job_t *job) {
    return job->remaining_time == 0;
}

void run_scheduler(job_queue_t *queue) {
    int current_time = 0;
    while (queue->num_jobs > 0) {
        job_queue_t ready_queue;
        init_job_queue(&ready_queue);
        for (int i = 0; i < queue->num_jobs; i++) {
            job_t *job = queue->jobs[i];
            if (job->arrival_time <= current_time) {
                add_job_to_queue(&ready_queue, job);
            }
        }
        if (ready_queue.num_jobs == 0) {
            current_time++;
            continue;
        }
        job_t *executing_job = ready_queue.jobs[0];
        for (int i = 1; i < ready_queue.num_jobs; i++) {
            job_t *job = ready_queue.jobs[i];
            if (job->burst_time < executing_job->burst_time) {
                executing_job = job;
            }
        }
        execute_job(executing_job);
        if (is_job_completed(executing_job)) {
            printf("Job %d completed in %d units of time.\n", executing_job->id, executing_job->burst_time);
            for (int i = 0; i < queue->num_jobs; i++) {
                if (queue->jobs[i] == executing_job) {
                    for (int j = i; j < queue->num_jobs - 1; j++) {
                        queue->jobs[j] = queue->jobs[j + 1];
                    }
                    queue->num_jobs--;
                    break;
                }
            }
        }
        current_time++;
    }
}

int main() {
    job_t jobs[] = {
        {1, 0, 10, 10},
        {2, 1, 5, 5},
        {3, 2, 3, 3},
        {4, 3, 8, 8}
    };
    job_queue_t queue;
    init_job_queue(&queue);
    for (int i = 0; i < sizeof(jobs) / sizeof(job_t); i++) {
        add_job_to_queue(&queue, &jobs[i]);
    }
    run_scheduler(&queue);
    return 0;
}

该程序使用了简单的最短作业优先算法。每当一个作业到达时，它会被加入队列。调度程序选择就绪队列中执行时间最短的作业进行执行，并在作业执行完毕后将其从队列中移除。程序输出每个作业的完成时间。